• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 40 matches

• 1992
• 
  Gul Agha, Ian A. Mason, Scott F. Smith, Carolyn L. Talcott:
  Towards a Theory of Actor Computation. CONCUR 1992: 565-579
• 
  Rajeev Alur, Costas Courcoubetis, Nicolas Halbwachs, David L. Dill, Howard Wong-Toi:
  Minimization of Timed Transition Systems. CONCUR 1992: 340-354
• 
  Éric Badouel, Philippe Darondeau:
  Structural Operational Specifications and the Trace Automata. CONCUR 1992: 302-316
• 
  Jos C. M. Baeten, Jan A. Bergstra:
  Discrete Time Process Algebra. CONCUR 1992: 401-420
• 
  Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka:
  Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract). CONCUR 1992: 472-485
• 
  Michele Boreale, Rocco De Nicola:
  Testing Equivalence for Mobile Processes (Extended Abstract). CONCUR 1992: 2-16
• 
  Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn:
  A Theory of Process with Localities (Extended Abstract). CONCUR 1992: 108-122
• 
  Ed Brinksma:
  On the Uniqueness of Fixpoints Modulo Observation Congruence. CONCUR 1992: 47-61
• 
  Olaf Burkart, Bernhard Steffen:
  Model Checking for Context-Free Processes. CONCUR 1992: 123-137
• 
  Søren Christensen:
  Distributed Bisimularity is Decidable for a Class of Infinite State-Space Systems. CONCUR 1992: 148-161
• 
  Søren Christensen, Hans Hüttel, Colin Stirling:
  Bisimulation Equivalence is Decidable for all Context-Free Processes. CONCUR 1992: 138-147
• 
  Jim Davies, Steve A. Schneider:
  Using CSP to Verify a Timed Protocol over a Fair Medium. CONCUR 1992: 355-369
• 
  Steven M. German:
  Programming in a General Model of Synchronization. CONCUR 1992: 534-549
• 
  Rob Gerth, Ruurd Kuiper, John Segers:
  Interface Refinement in Reactive Systems (Extended Abstract). CONCUR 1992: 77-93
• 
  Ursula Goltz, Ruurd Kuiper, Wojciech Penczek:
  Propositional Temporal Logics and Equivalences. CONCUR 1992: 222-236
• 
  Eric Goubault, Thomas P. Jensen:
  Homology of Higher Dimensional Automata. CONCUR 1992: 254-268
• 
  Jan Friso Groote, Faron Moller:
  Verification of Parallel Systems via Decomposition. CONCUR 1992: 62-76
• 
  Matthew Hennessy:
  Concurrent Testing of Processes (Extended Abstract). CONCUR 1992: 94-107
• 
  Lalita Jategaonkar, Albert R. Meyer:
  Testing Equivalence for Petri Nets with Action Refinement: Preliminary Report. CONCUR 1992: 17-31
• 
  Roope Kaivola, Antti Valmari:
  The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic. CONCUR 1992: 207-221
• 
  Günter Karjoth:
  Implementing LOTOS Specifications by Communicating State Machines. CONCUR 1992: 386-400
• 
  Steven Klusener:
  The Silent Step in Time. CONCUR 1992: 421-435
• 
  Butler W. Lampson, Nancy A. Lynch, Jørgen F. Søgaard-Andersen:
  At-Most-Once Message Delivery. A Case Study in Algorithm Verification. CONCUR 1992: 317-324
• 
  Kim Guldstrand Larsen, Arne Skou:
  Compositional Verification of Probabilistic Processes. CONCUR 1992: 456-471
• 
  Florence Maraninchi:
  Operational and Compositional Semantics of Synchronous Automaton Compositions. CONCUR 1992: 550-564
• 
  José Meseguer, Ugo Montanari, Vladimiro Sassone:
  On the Semantics of Petri Nets. CONCUR 1992: 286-301
• 
  Robin Milner:
  The Polyadic Pi-calculus (Abstract). CONCUR 1992: 1
• 
  Joachim Parrow, Peter Sjödin:
  Multiway Synchronization Verified with Coupled Simulation. CONCUR 1992: 518-533
• 
  Doron A. Peled:
  Sometimes 'Some' is as Good as 'All'. CONCUR 1992: 192-206
• 
  Amir Pnueli:
  How Vital is Liveness? Verifying Timing Properties of Reactive and Hybrid Systems (Extended Abstract). CONCUR 1992: 162-175

skipping 10 more matches