default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6th FoSSaCS 2003: Warsaw, Poland
- Andrew D. Gordon:
Foundations of Software Science and Computational Structures, 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings. Lecture Notes in Computer Science 2620, Springer 2003, ISBN 3-540-00897-7
Invited Paper
- Samson Abramsky
, Radha Jagadeesan:
A Game Semantics for Generic Polymorphism. 1-22
Contributed Papers
- Michael Gordon Abbott, Thorsten Altenkirch, Neil Ghani:
Categories of Containers. 23-38 - Parosh Aziz Abdulla, Alexander Moshe Rabinovich:
Verification of Probabilistic Systems with Faulty Communication. 39-53 - Andreas Abel, Ralph Matthes, Tarmo Uustalu:
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes. 54-69 - André Arnold, Luigi Santocanale:
Ambiguous Classes in the Games µ-Calculus Hierarchy. 70-86 - Tamarah Arons, Amir Pnueli, Lenore D. Zuck:
Parameterized Verification by Probabilistic Abstraction. 87-102 - Martin Berger, Kohei Honda, Nobuko Yoshida:
Genericity and the pi-Calculus. 103-119 - Nathalie Bertrand, Philippe Schnoebelen:
Model Checking Lossy Channels Systems Is Probably Decidable. 120-135 - Bruno Blanchet, Andreas Podelski:
Verification of Cryptographic Protocols: Tagging Enforces Termination. 136-152 - Eduardo Bonelli:
A Normalisation Result for Higher-Order Calculi with Explicit Substitutions. 153-168 - Iovka Boneva, Jean-Marc Talbot:
When Ambients Cannot Be Opened. 169-184 - Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion:
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. 185-199 - Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell:
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity. 200-215 - Luca Cardelli, Philippa Gardner, Giorgio Ghelli:
Manipulating Trees with Hidden Labels. 216-232 - Ernst-Erich Doberkat:
The Converse of a Stochastic Relation. 233-249 - Jana Dunfield, Frank Pfenning:
Type Assignment for Intersections and Unions in Call-by-Value Languages. 250-266 - Wan J. Fokkink, Jun Pang:
Cones and Foci for Protocol Verification Revisited. 267-281 - Matthew Hennessy, Massimo Merro, Julian Rathke:
Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. 282-298 - Emanuel Kieronski:
The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard. 299-312 - James Laird:
A Game Semantics of Linearly Used Continuations. 313-327 - Denis Lugiez:
Counting and Equality Constraints for Multitree Automata. 328-342 - Patrick Maier:
Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete. 343-357 - Eugenio Moggi, Sonia Fagorzi:
A Monadic Multi-stage Metalanguage. 358-374 - Alberto Momigliano, Simon Ambler:
Multi-level Meta-reasoning with Higher-Order Abstract Syntax. 375-391 - John Power, Konstantinos Tourlas:
Abstraction in Reasoning about Higraph-Based Systems. 392-408 - Vladimiro Sassone, Pawel Sobocinski:
Deriving Bisimulation Congruences: 2-Categories Vs Precategories. 409-424 - Christoph Sprenger, Mads Dam:
On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the µ-Calculus. 425-440
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-23 22:39 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:
