Abstract is missing.
- A Game Semantics for Generic PolymorphismSamson Abramsky, Radha Jagadeesan. 1-22 [doi]
- Categories of ContainersMichael Abbott, Thorsten Altenkirch, Neil Ghani. 23-38 [doi]
- Verification of Probabilistic Systems with Faulty CommunicationParosh Aziz Abdulla, Alexander Moshe Rabinovich. 39-53 [doi]
- Generalized Iteration and Coiteration for Higher-Order Nested DatatypesAndreas Abel, Ralph Matthes, Tarmo Uustalu. 54-69 [doi]
- Ambiguous Classes in the Games µ-Calculus HierarchyAndré Arnold, Luigi Santocanale. 70-86 [doi]
- Parameterized Verification by Probabilistic AbstractionTamarah Arons, Amir Pnueli, Lenore D. Zuck. 87-102 [doi]
- Genericity and the pi-CalculusMartin Berger, Kohei Honda, Nobuko Yoshida. 103-119 [doi]
- Model Checking Lossy Channels Systems Is Probably DecidableNathalie Bertrand, Ph. Schnoebelen. 120-135 [doi]
- Verification of Cryptographic Protocols: Tagging Enforces TerminationBruno Blanchet, Andreas Podelski. 136-152 [doi]
- A Normalisation Result for Higher-Order Calculi with Explicit SubstitutionsEduardo Bonelli. 153-168 [doi]
- When Ambients Cannot Be OpenedIovka Boneva, Jean-Marc Talbot. 169-184 [doi]
- Computability over an Arbitrary Structure. Sequential and Parallel Polynomial TimeOlivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion. 185-199 [doi]
- An Intrinsic Characterization of Approximate Probabilistic BisimilarityFranck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell. 200-215 [doi]
- Manipulating Trees with Hidden LabelsLuca Cardelli, Philippa Gardner, Giorgio Ghelli. 216-232 [doi]
- The Converse of a Stochastic RelationErnst-Erich Doberkat. 233-249 [doi]
- Type Assignment for Intersections and Unions in Call-by-Value LanguagesJoshua Dunfield, Frank Pfenning. 250-266 [doi]
- Cones and Foci for Protocol Verification RevisitedWan Fokkink, Jun Pang. 267-281 [doi]
- Towards a Behavioural Theory of Access and Mobility Control in Distributed SystemsMatthew Hennessy, Massimo Merro, Julian Rathke. 282-298 [doi]
- The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-HardEmanuel Kieronski. 299-312 [doi]
- A Game Semantics of Linearly Used ContinuationsJames Laird. 313-327 [doi]
- Counting and Equality Constraints for Multitree AutomataDenis Lugiez. 328-342 [doi]
- Compositional Circular Assume-Guarantee Rules Cannot Be Sound and CompletePatrick Maier. 343-357 [doi]
- A Monadic Multi-stage MetalanguageEugenio Moggi, Sonia Fagorzi. 358-374 [doi]
- Multi-level Meta-reasoning with Higher-Order Abstract SyntaxAlberto Momigliano, Simon Ambler. 375-391 [doi]
- Abstraction in Reasoning about Higraph-Based SystemsJohn Power, Konstantinos Tourlas. 392-408 [doi]
- Deriving Bisimulation Congruences: 2-Categories Vs PrecategoriesVladimiro Sassone, Pawel Sobocinski. 409-424 [doi]
- On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the µ-CalculusChristoph Sprenger, Mads Dam. 425-440 [doi]