Abstract is missing.
- Semantical Evaluations as Monadic Second-Order Compatible Structure TransformationsBruno Courcelle. 1-4 [doi]
- Verification for Java s Reentrant Multithreading ConceptErika Ábrahám-Mumm, Frank S. de Boer, Willem P. de Roever, Martin Steffen. 5-20 [doi]
- On the Integration of Observability and Reachability ConceptsMichel Bidoit, Rolf Hennicker. 21-36 [doi]
- Proving Correctness of Timed Concurrent Constraint ProgramsFrank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo. 37-51 [doi]
- Generalised Regular MSC LanguagesBenedikt Bollig, Martin Leucker, Thomas Noll. 52-66 [doi]
- On Compositional Reasoning in the Spi-calculusMichele Boreale, Daniele Gorla. 67-81 [doi]
- On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and ObservabilityCorina Cîrstea. 82-97 [doi]
- A First-Order One-Pass CPS TransformationOlivier Danvy, Lasse R. Nielsen. 98-113 [doi]
- The Demonic Product of Probabilistic RelationsErnst-Erich Doberkat. 114-128 [doi]
- Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic FormulationGian Luigi Ferrari, Ugo Montanari, Marco Pistore. 129-158 [doi]
- Varieties of EffectsCarsten Führmann. 144-158 [doi]
- A Characterization of Families of Graphs in Which Election Is PossibleEmmanuel Godard, Yves Métivier. 159-172 [doi]
- Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower BoundsPetr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa. 172-186 [doi]
- Efficient Type MatchingSomesh Jha, Jens Palsberg, Tian Zhao. 187-204 [doi]
- Higher-Order Pushdown Trees Are EasyTeodor Knapik, Damian Niwinski, Pawel Urzyczyn. 205-222 [doi]
- Conflict Detection and Resolution in Access Control Policy SpecificationsManuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce. 223-237 [doi]
- Logics Admitting Final SemanticsAlexander Kurz. 238-249 [doi]
- Model Checking Fixed Point Logic with ChopMartin Lange, Colin Stirling. 250-263 [doi]
- On Model Checking Durational Kripke StructuresFrançois Laroussinie, Nicolas Markey, Ph. Schnoebelen. 264-279 [doi]
- Model-Checking Infinite Systems Generated by Ground Tree RewritingChristof Löding. 280-294 [doi]
- Bounded MSC CommunicationMarkus Lohrey, Anca Muscholl. 295-309 [doi]
- The Informatic Derivative at a Compact ElementKeye Martin. 310-325 [doi]
- Heterogeneous Development Graphs and Heterogeneous BorrowingTill Mossakowski. 326-341 [doi]
- Notions of Computation Determine MonadsGordon D. Plotkin, John Power. 342-356 [doi]
- A Calculus of Circular Proofs and Its Categorical SemanticsLuigi Santocanale. 357-371 [doi]
- Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free ProcessesUlrich Schöpp, Alex K. Simpson. 372-386 [doi]
- Note on the Tableau Technique for Commutative Transition SystemsJirí Srba. 387-401 [doi]
- A Semantic Basis for Local ReasoningHongseok Yang, Peter W. O Hearn. 402-416 [doi]
- Linearity and BisimulationNobuko Yoshida, Kohei Honda, Martin Berger. 417-434 [doi]