Front matter
1-24
Adequacy for Algebraic Effects
Gordon Plotkin and John Power
25-41
Secrecy Types for Asymmetric Communication
Martín Abadi and Bruno Blanchet
42-56
Axiomatizing Tropical Semirings
Luca Aceto, Zoltán Ésik and Anna Ingólfsdóttir
57-71
Type Isomorphisms and Proof Reuse in Dependent Type Theory
Gilles Barthe and Olivier Pons
72-87
On the Duality between Observability and Reachability
Michel Bidoit, Rolf Hennicker and Alexander Kurz
88-103
The Finite Graph Problem for Two-Way Alternating Automata
Mikolaj Bojańczyk
104-120
High-Level Petri Nets as Type Theories in the Join Calculus
Maria Grazia Buscemi and Vladimiro Sassone
121-136
Temporary Data in Shared Dataspace Coordination Languages
Nadia Busi, Roberto Gorrieri and Gianluigi Zavattaro
137-151
On Garbage and Program Logic
Cristiano Calcagno and Peter W. O’Hearn
152-167
The Complexity of Model Checking Mobile Ambients
Witold Charatonik, Silvano Dal Zilio, Andrew D. Gordon, Supratik Mukhopadhyay and Jean-Marc Talbot
168-183
The Rho Cube
Horatiu Cirstea, Claude Kirchner and Luigi Liquori
184-198
Type Inference with Recursive Type Equations
Mario Coppo
199-213
On the Modularity of Deciding Call-by-Need
Irène Durand and Aart Middeldorp
214-229
Synchronized Tree Languages Revisited and New Applications
Valérie Gouranton, Pierre Réty and Helmut Seidl
230-245
Computational Completeness of Programming Languages Based on Graph Transformation
Annegret Habel and Detlef Plump
246-260
Axioms for Recursion in Call-by-Value
(Extended Abstract)
Masahito Hasegawa and Yoshihiko Kakutani
261-275
Class Analysis of Object-Oriented Programs through Abstract Interpretation
Thomas Jensen and Fausto Spoto
276-286
On the Complexity of Parity Word Automata
Valerie King, Orna Kupferman and Moshe Y. Vardi
287-302
Foundations for a Graph-Based Approach to the Specification of Access Control Policies
Manuel Koch, Luigi Vincenzo Mancini and Francesco Parisi-Presicce
303-317
Categories of Processes Enriched in Final Coalgebras
Sava Krstić, John Launchbury and Duško Pavlović
318-331
Model Checking CTL+ and FCTL Is Hard
François Laroussinie, Nicolas Markey and Philippe Schnoebelen
332-346
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Rémi Morin
347-363
Verified Bytecode Verifiers
Tobias Nipkow
364-378
Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the π-Calculus and Mechanizing the Theory of Contexts
Christine Röckl, Daniel Hirschkoff and Stefan Berghofer
379-393
Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes
Colin Stirling
394-408
An Axiomatic Semantics for the Synchronous Language
Gentzen
Simone Tini
409-412
Marrella
and the Verification of an Embedded System
Dominique Ambroise, Patrick Augé, Kamel Bouchefra and Brigitte Rozoy
Back matter