CONCUR 2004 : concurrency theory (London, 31 August - 3 September 2004)Gardner, Philippa; Yoshida, Nobuko.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-22940-X, XIII, 528 p, isbn 3-540-22940-XConference Proceedings

CONCUR 2003 : concurrency theory (Marseille, 3-5 September 2003)Amadio, Roberto; Lugiez, Denis.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40753-7, XI, 524 p, isbn 3-540-40753-7Conference Proceedings

Commonsense Understanding of Concurrency Computing Students and Concert TicketsLEWANDOWSKI, Gary; BOUVIER, Dennis J; CHEN, Tzu-Yi et al.Communications of the ACM. 2010, Vol 53, Num 7, pp 60-70, issn 0001-0782, 11 p.Article

Event-state duality: The enriched casePRATT, Vaughan R.Lecture notes in computer science. 2002, pp 41-56, issn 0302-9743, isbn 3-540-44043-7, 16 p.Conference Paper

A universal technique for fast and flexible instruction-set architecture simulationNOHL, Achim; BRAUN, Gunnar; SCHLIEBUSCH, Oliver et al.Design automation conference. 2002, pp 22-27, isbn 1-58113-461-4, 6 p.Conference Paper

RTL C-based methodology for designing and verifying a multi-threaded processorSEMERIA, Luc; SEAWRIGHT, Andrew; MEHRA, Renu et al.Design automation conference. 2002, pp 123-128, isbn 1-58113-461-4, 6 p.Conference Paper

A very simple construction of 1-writer multireader multivalued atomic variableVIDYASANKAR, K.Information processing letters. 1991, Vol 37, Num 6, pp 323-326, issn 0020-0190, 4 p.Article

Two Examples of Parallel Programming without Concurrency Constructs (PP-CC)CHEN DING.ACM SIGPLAN notices. 2011, Vol 46, Num 8, pp 299-300, issn 1523-2867, 2 p.Conference Paper

Concurrent Systems. IFIP Working Group 10.3JESSHOPE, Chris.Parallel processing letters. 2008, Vol 18, Num 2, pp 199-306, issn 0129-6264, 107 p.Conference Paper

CONCUR 2006 (concurrency theory)Baier, Christel; Hermanns, Holger.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-37376-4, 1Vol, XIII-523 p, isbn 3-540-37376-4Conference Proceedings

Compositionality for probabilistic automataLYNCH, Nancy; SEGALA, Roberto; VAANDRAGER, Frits et al.Lecture notes in computer science. 2003, pp 208-221, issn 0302-9743, isbn 3-540-40753-7, 14 p.Conference Paper

Local Action Systems and DPO graph transformationJANSSENS, Dirk.Formal and natural computing-eessays dedicated to Grzegorz Rozenberg. Lecture notes in computer science. 2002, pp 138-157, issn 0302-9743, isbn 3-540-43190-XBook Chapter

Decidability of strong bisimilarity for timed BPPLASOTA, Slawomir.Lecture notes in computer science. 2002, pp 562-578, issn 0302-9743, isbn 3-540-44043-7, 17 p.Conference Paper

A detailed cost model for concurrent use with hardware/software co-designRAGAN, Daniel; SANDBORN, Peter; STOAKS, Paul et al.Design automation conference. 2002, pp 269-274, isbn 1-58113-461-4, 6 p.Conference Paper

Why is simulation harder than bisimulation?KUCERA, Antonin; MAYR, Richard.Lecture notes in computer science. 2002, pp 594-609, issn 0302-9743, isbn 3-540-44043-7, 16 p.Conference Paper

Timing and causality in process algebraACETO, L; MURPHY, D.Acta informatica. 1996, Vol 33, Num 4, pp 317-350, issn 0001-5903Article

Numéro spécial ADATSI. Technique et science informatiques. 1994, Vol 13, Num 5, issn 0752-4072, 193 p.Serial Issue

CONCUR 2005 : concurrency theory (San Francisco CA? 23-26 August 2005)Abadi, Martin; Alfaro, Luca de.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28309-9, XIV, 578 p, isbn 3-540-28309-9Conference Proceedings

An inter-entry invocation selection mechanism for concurrent programming languagesKEEN, Aaron W; OLSSON, Ronald A.Lecture notes in computer science. 2003, pp 770-780, issn 0302-9743, isbn 3-540-40788-X, 11 p.Conference Paper

Coordination models and languages (York, 8-11 April 2002)Farhad Arhab; Talcott, Carolyn.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-43410-0, XI, 406 p, isbn 3-540-43410-0Conference Proceedings

Logical properties of name restrictionCARDELLI, Luca; GORDON, Andrew D.Lecture notes in computer science. 2001, pp 46-60, issn 0302-9743, isbn 3-540-41960-8Conference Paper

Model-checking of correctness conditions for concurrent objectsALUR, R; MCMILLAN, K; PELED, D et al.Information and computation (Print). 2000, Vol 160, Num 1-2, pp 167-188, issn 0890-5401Article

A note on fairness in I/O automataROMIJN, J; VAANDRAGER, F.Information processing letters. 1996, Vol 59, Num 5, pp 245-250, issn 0020-0190Article

Towards Concurrency Refactoring for X10MARKSTRUM, Shane; FUHRER, Robert M; MILLSTEIN, Todd et al.ACM SIGPLAN notices. 2009, Vol 44, Num 4, pp 303-304, issn 1523-2867, 2 p.Conference Paper

Page / 92