default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th FoSSaCS 2002: Grenoble, France
- 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
Invited Paper
- Bruno Courcelle:
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations. 1-4
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 - Michel Bidoit, Rolf Hennicker:
On the Integration of Observability and Reachability Concepts. 21-36 - Frank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo:
Proving Correctness of Timed Concurrent Constraint Programs. 37-51 - Benedikt Bollig, Martin Leucker, Thomas Noll:
Generalised Regular MSC Languages. 52-66 - Michele Boreale, Daniele Gorla:
On Compositional Reasoning in the Spi-calculus. 67-81 - Corina Cîrstea:
On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability. 82-97 - Olivier Danvy, Lasse R. Nielsen:
A First-Order One-Pass CPS Transformation. 98-113 - Ernst-Erich Doberkat:
The Demonic Product of Probabilistic Relations. 114-128 - Gian-Luigi Ferrari, Ugo Montanari, Marco Pistore:
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation. 129-158 - Carsten Führmann:
Varieties of Effects. 144-158 - Emmanuel Godard, Yves Métivier:
A Characterization of Families of Graphs in Which Election Is Possible. 159-172 - Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa:
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. 172-186 - Somesh Jha, Jens Palsberg, Tian Zhao:
Efficient Type Matching. 187-204 - Teodor Knapik, Damian Niwinski, Pawel Urzyczyn:
Higher-Order Pushdown Trees Are Easy. 205-222 - Manuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce:
Conflict Detection and Resolution in Access Control Policy Specifications. 223-237 - Alexander Kurz:
Logics Admitting Final Semantics. 238-249 - Martin Lange, Colin Stirling:
Model Checking Fixed Point Logic with Chop. 250-263 - François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
On Model Checking Durational Kripke Structures. 264-279 - Christof Löding:
Model-Checking Infinite Systems Generated by Ground Tree Rewriting. 280-294 - Markus Lohrey, Anca Muscholl:
Bounded MSC Communication. 295-309 - Keye Martin:
The Informatic Derivative at a Compact Element. 310-325 - Till Mossakowski:
Heterogeneous Development Graphs and Heterogeneous Borrowing. 326-341 - Gordon D. Plotkin, John Power:
Notions of Computation Determine Monads. 342-356 - Luigi Santocanale:
A Calculus of Circular Proofs and Its Categorical Semantics. 357-371 - Ulrich Schöpp, Alex K. Simpson:
Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes. 372-386 - Jirí Srba:
Note on the Tableau Technique for Commutative Transition Systems. 387-401 - Hongseok Yang, Peter W. O'Hearn:
A Semantic Basis for Local Reasoning. 402-416 - Nobuko Yoshida, Kohei Honda, Martin Berger:
Linearity and Bisimulation. 417-434
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-04-25 00:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
