Abstract is missing.
- A Spatial Logic for ConcurrencyLuís Caires, Luca Cardelli. 1-37 [doi]
- Boxed AmbientsMichele Bugliesi, Giuseppe Castagna, Silvia Crafa. 38-63 [doi]
- A Typed Process Calculus for Fine-Grained Resource Access Control in Distributed ComputationDaisuke Hoshina, Eijiro Sumii, Akinori Yonezawa. 64-81 [doi]
- Formal Eavesdropping and Its Computational InterpretationMartín Abadi, Jan Jürjens. 82-94 [doi]
- Resource-Passing Concurrent ProgrammingKazunori Ueda. 95-126 [doi]
- Solo DiagramsCosimo Laneve, Joachim Parrow, Björn Victor. 127-144 [doi]
- Observational Equivalence for Synchronized Graph Rewriting with MobilityBarbara König, Ugo Montanari. 145-164 [doi]
- Fixed-Point Logic with the Approximation Modality and Its Kripke CompletenessHiroshi Nakano. 165-182 [doi]
- Termination Proofs and Complexity CertificationDaniel Leivant. 183-200 [doi]
- A Renee Equation for Algorithmic ComplexityKeye Martin. 201-218 [doi]
- Nominal Logic: A First Order Theory of Names and BindingAndrew M. Pitts. 219-242 [doi]
- A Logic Programming Language Based on Binding AlgebrasMakoto Hamana. 243-262 [doi]
- Proof-Search and Countermodel Generation in Propositional BI LogicDidier Galmiche, Daniel Méry. 263-282 [doi]
- Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-OrdersMizuhito Ogawa. 283-297 [doi]
- Modelisation of Timed Automata in CoqChristine Paulin-Mohring. 298-315 [doi]
- Model-Checking LTL with Regular Valuations for Pushdown SystemsJavier Esparza, Antonín Kucera, Stefan Schwoon. 316-339 [doi]
- What Will Be Eventually True of Polynomial Hybrid Automata?Martin Fränzle. 340-359 [doi]
- Non-structural Subtype Entailment in Automata TheoryJoachim Niehren, Tim Priesnitz. 360-384 [doi]
- Bisimulation and Other Undecidable Equivalences for Lossy Channel SystemsPh. Schnoebelen. 385-399 [doi]
- Weakest Congruence Results Concerning Any-Lock Antti Puhakka. 400-419 [doi]
- Design and Correctness of Program Transformations Based on Control-Flow AnalysisAnindya Banerjee, Nevin Heintze, Jon G. Riecke. 420-447 [doi]
- Infinite Intersection and Union Types for the Lazy Lambda CalculusMarcello M. Bonsangue, Joost N. Kok. 448-458 [doi]
- Strong Normalization of Second Order Symmetric Lambda-mu CalculusYoriyuki Yamagata. 459-467 [doi]
- The Girard-Reynolds IsomorphismPhilip Wadler. 468-491 [doi]
- Lightweight Analysis of Object InteractionsDaniel Jackson, Alan Fekete. 492-513 [doi]
- Typing Assembly Programs with Explicit ForwardingLennart Beringer. 514-534 [doi]
- The UDP Calculus: Rigorous Semantics for Real NetworkingAndrei Serjantov, Peter Sewell, Keith Wansbrough. 535-559 [doi]
- Unison: A File Synchronizer and Its SpecificationBenjamin C. Pierce, Jérôme Vouillon. 560 [doi]