• 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 30 matches

• 2002
• 
  Erika Ábrahám-Mumm, Frank S. de Boer, Willem P. de Roever, Martin Steffen:
  Verification for Java's Reentrant Multithreading Concept. FoSSaCS 2002: 5-20
• 
  Michel Bidoit, Rolf Hennicker:
  On the Integration of Observability and Reachability Concepts. FoSSaCS 2002: 21-36
• 
  Frank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo:
  Proving Correctness of Timed Concurrent Constraint Programs. FoSSaCS 2002: 37-51
• 
  Benedikt Bollig, Martin Leucker, Thomas Noll:
  Generalised Regular MSC Languages. FoSSaCS 2002: 52-66
• 
  Michele Boreale, Daniele Gorla:
  On Compositional Reasoning in the Spi-calculus. FoSSaCS 2002: 67-81
• 
  Corina Cîrstea:
  On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability. FoSSaCS 2002: 82-97
• 
  Bruno Courcelle:
  Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations. FoSSaCS 2002: 1-4
• 
  Olivier Danvy, Lasse R. Nielsen:
  A First-Order One-Pass CPS Transformation. FoSSaCS 2002: 98-113
• 
  Ernst-Erich Doberkat:
  The Demonic Product of Probabilistic Relations. FoSSaCS 2002: 114-128
• 
  Gian-Luigi Ferrari, Ugo Montanari, Marco Pistore:
  Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation. FoSSaCS 2002: 129-158
• 
  Carsten Führmann:
  Varieties of Effects. FoSSaCS 2002: 144-158
• 
  Emmanuel Godard, Yves Métivier:
  A Characterization of Families of Graphs in Which Election Is Possible. FoSSaCS 2002: 159-172
• 
  Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa:
  Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. FoSSaCS 2002: 172-186
• 
  Somesh Jha, Jens Palsberg, Tian Zhao:
  Efficient Type Matching. FoSSaCS 2002: 187-204
• 
  Teodor Knapik, Damian Niwinski, Pawel Urzyczyn:
  Higher-Order Pushdown Trees Are Easy. FoSSaCS 2002: 205-222
• 
  Manuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce:
  Conflict Detection and Resolution in Access Control Policy Specifications. FoSSaCS 2002: 223-237
• 
  Alexander Kurz:
  Logics Admitting Final Semantics. FoSSaCS 2002: 238-249
• 
  Martin Lange, Colin Stirling:
  Model Checking Fixed Point Logic with Chop. FoSSaCS 2002: 250-263
• 
  François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
  On Model Checking Durational Kripke Structures. FoSSaCS 2002: 264-279
• 
  Christof Löding:
  Model-Checking Infinite Systems Generated by Ground Tree Rewriting. FoSSaCS 2002: 280-294
• 
  Markus Lohrey, Anca Muscholl:
  Bounded MSC Communication. FoSSaCS 2002: 295-309
• 
  Keye Martin:
  The Informatic Derivative at a Compact Element. FoSSaCS 2002: 310-325
• 
  Till Mossakowski:
  Heterogeneous Development Graphs and Heterogeneous Borrowing. FoSSaCS 2002: 326-341
• 
  Gordon D. Plotkin, John Power:
  Notions of Computation Determine Monads. FoSSaCS 2002: 342-356
• 
  Luigi Santocanale:
  A Calculus of Circular Proofs and Its Categorical Semantics. FoSSaCS 2002: 357-371
• 
  Ulrich Schöpp, Alex K. Simpson:
  Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes. FoSSaCS 2002: 372-386
• 
  Jirí Srba:
  Note on the Tableau Technique for Commutative Transition Systems. FoSSaCS 2002: 387-401
• 
  Hongseok Yang, Peter W. O'Hearn:
  A Semantic Basis for Local Reasoning. FoSSaCS 2002: 402-416
• 
  Nobuko Yoshida, Kohei Honda, Martin Berger:
  Linearity and Bisimulation. FoSSaCS 2002: 417-434
• 
  Mogens Nielsen, Uffe Engberg:
  Foundations of Software Science and Computation Structures, 5th International Conference, FOSSACS 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002, Proceedings. Lecture Notes in Computer Science 2303, Springer 2002, ISBN 3-540-43366-X [contents]