Abstract is missing.
- Adequacy for Algebraic EffectsGordon D. Plotkin, John Power. 1-24 [doi]
- Secrecy Types for Asymmetric CommunicationMartín Abadi, Bruno Blanchet. 25-41 [doi]
- Axiomatizing Tropical SemiringsLuca Aceto, Zoltán Ésik, Anna Ingólfsdóttir. 42-56 [doi]
- Type Isomorphisms and Proof Reuse in Dependent Type TheoryGilles Barthe, Olivier Pons. 57-71 [doi]
- On the Duality between Observability and ReachabilityMichel Bidoit, Rolf Hennicker, Alexander Kurz. 72-87 [doi]
- The Finite Graph Problem for Two-Way Alternating AutomataMikolaj Bojanczyk. 88-103 [doi]
- High-Level Petri Nets as Type Theories in the Join CalculusMaria Grazia Buscemi, Vladimiro Sassone. 104-120 [doi]
- Temporary Data in Shared Dataspace Coordination LanguagesNadia Busi, Roberto Gorrieri, Gianluigi Zavattaro. 121-136 [doi]
- On Garbage and Program LogicCristiano Calcagno, Peter W. O Hearn. 137-151 [doi]
- The Complexity of Model Checking Mobile AmbientsWitold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot. 152-167 [doi]
- The Rho CubeHoratiu Cirstea, Claude Kirchner, Luigi Liquori. 168-183 [doi]
- Type Inference with Recursive Type EquationsMario Coppo. 184-198 [doi]
- On the Modularity of Deciding Call-by-NeedIrène Durand, Aart Middeldorp. 199-213 [doi]
- Synchronized Tree Languages Revisited and New ApplicationsValérie Gouranton, Pierre Réty, Helmut Seidl. 214-229 [doi]
- Computational Completeness of Programming Languages Based on Graph TransformationAnnegret Habel, Detlef Plump. 230-245 [doi]
- Axioms for Recursion in Call-by-ValueMasahito Hasegawa, Yoshihiko Kakutani. 246-260 [doi]
- Class Analysis of Object-Oriented Programs through Abstract InterpretationThomas P. Jensen, Fausto Spoto. 261-275 [doi]
- On the Complexity of Parity Word AutomataValerie King, Orna Kupferman, Moshe Y. Vardi. 276-286 [doi]
- Foundations for a Graph-Based Approach to the Specification of Access Control PoliciesManuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce. 287-302 [doi]
- Categories of Processes Enriched in Final CoalgebrasSava Krstic, John Launchbury, Dusko Pavlovic. 303-317 [doi]
- Model Checking CTL:::+::: and FCTL is HardFrançois Laroussinie, Nicolas Markey, Ph. Schnoebelen. 318-331 [doi]
- On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace TheoryRémi Morin. 332-346 [doi]
- Verified Bytecode VerifiersTobias Nipkow. 347-363 [doi]
- Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the pi-Calculus and Mechanizing the Theory of ContextsChristine Röckl, Daniel Hirschkoff, Stefan Berghofer. 364-378 [doi]
- Decidability of Weak Bisimilarity for a Subset of Basic Parallel ProcessesColin Stirling. 379-393 [doi]
- An Axiomatic Semantics for the Synchronous Language GentzenSimone Tini. 394-409 [doi]
- MARRELLA and the Verification of an Embedded SystemDominique Ambroise, Patrick Augé, Kamel Bouchefra, Brigitte Rozoy. 409-412 [doi]