5. FoSSaCS 2002: Grenoble, France (Part of ETAPS 2002)

@proceedings{DBLP:conf/fossacs/2002,
  editor    = {Mogens Nielsen and
               Uffe Engberg},
  title     = {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},
  booktitle = {FoSSaCS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2303},
  year      = {2002},
  isbn      = {3-540-43366-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Paper

• Bruno Courcelle:
  Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations. 1-4
  Electronic Edition (Springer LINK) BibTeX

Contributed Papers

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