Abstract is missing.
- Norm Functions for Probabilistic Bisimulations with DelaysChristel Baier, Mariëlle Stoelinga. 1-16 [doi]
- Constructor Subtyping in the Calculus of Inductive ConstructionsGilles Barthe, Femke van Raamsdonk. 17-34 [doi]
- Verifying Performance Equivalence for Timed Basic Parallel ProcessesBéatrice Bérard, Anne Labroue, Ph. Schnoebelen. 35-47 [doi]
- On Word Rewriting Systems Having a Rational DerivationDidier Caucal. 48-62 [doi]
- Proof Nets and Explicit SubstitutionsRoberto Di Cosmo, Delia Kesner, Emmanuel Polonovski. 63-81 [doi]
- Typing Local Definitions and Conditional Expressions with Rank 2 IntersectionFerruccio Damiani. 82-97 [doi]
- Hierarchical Graph TransformationFrank Drewes, Berthold Hoffmann, Detlef Plump. 98-113 [doi]
- A Program Refinement Framework Supporting Reasoning about Knowledge and TimeKai Engelhardt, Ron van der Meyden, Yoram Moses. 114-129 [doi]
- A Higher-Order Simulation Relation for System FJo Erskine Hannay. 130-145 [doi]
- Probabilistic Asynchronous pi-CalculusOltea Mihaela Herescu, Catuscia Palamidessi. 146-160 [doi]
- Constructive Data Refinement in Typed Lambda CalculusFurio Honsell, John Longley, Donald Sannella, Andrzej Tarlecki. 161-176 [doi]
- On Recognizable Stable Trace LanguagesJean-François Husson, Rémi Morin. 177-191 [doi]
- The State Explosion Problem from Trace to Bisimulation EquivalenceFrançois Laroussinie, Ph. Schnoebelen. 192-207 [doi]
- A Proof System for Timed AutomataHuimin Lin, Wang Yi. 208-222 [doi]
- Categorical Models for Intuitionistic and Linear Type TheoryMaria Emilia Maietti, Valeria de Paiva, Eike Ritter. 223-237 [doi]
- Locality and Polyadicity in Asynchronous Name-Passing CalculiMassimo Merro. 238-251 [doi]
- On Rational GraphsChristophe Morvan. 252-266 [doi]
- Sequential and Concurrent Abstract Machines for Interaction NetsJorge Sousa Pinto. 267-282 [doi]
- On Synchronous and Asynchronous Mobile ProcessesPaola Quaglia, David Walker. 283-296 [doi]
- Type Inference for First-Order LogicAleksy Schubert. 297-313 [doi]
- An Algebraic Foundation for Adaptive ProgrammingPeter Thiemann. 314-328 [doi]
- Predicate Logic and Tree Automata with TestsRalf Treinen. 329-343 [doi]
- Compositional Verification in Linear-Time Temporal LogicYih-Kuen Tsay. 344-358 [doi]
- On the Semantics of Refinement CalculiHongseok Yang, Uday S. Reddy. 359-374 [doi]
- Subtyping and Typing Algorithms for Mobile AmbientsPascal Zimmer. 375-390 [doi]