| Efficient Type Matching |
Somesh Jha
Jens Palsberg
Tian Zhao |
| The Demonic Product of Probabilistic Relations |
Ernst-Erich Doberkat |
| Characterization of families of graphs
in which election is possible |
E. GODARD
Y. METIVIER |
| A Semantic Basis for Local Reasoning |
Hongseok Yang and Peter O'Hearn |
| Proving correctness of Timed Concurrent Constraint Programs |
F. de Boer, M. Gabbrielli and M.C. Meo |
| Note on the Tableau Technique for
Commutative Transition Systems |
Jiri Srba |
| A calculus of circular proofs
and its categorical semantics |
Luigi Santocanale |
| Conflict Detection and Resolution in Access Control Policy Specifications |
Manuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce |
| Varieties of Effects |
Carsten Fuhrmann |
| Notions of computation determine monads |
Gordon Plotkin and John Power |
| Model Checking Fixed Point Logic with Chop |
Martin Lange,
Colin Stirling |
| Verifying Temporal Properties using Explicit Approximants: Completeness for Context-free Processes |
Ulrich Schoepp, Alex Simpson |
| Model-Checking Infinite Systems Generated
by Ground Tree Rewriting |
Christof Löding |
| On Specification Logics for Algebra-Coalgebra
Structures: reconciling Reachability and Observability |
Corina Cirstea |
| On model checking durational Kripke structures |
F. Laroussinie and N. Markey and Ph. Schnoebelen |
| Bounded MSC Communication |
Markus Lohrey and Anca Muscholl |
| Heterogeneous development graphs and heterogeneous borrowing |
Till Mossakowski |
| Equivalence-Checking with One-Counter Automata:
A Generic Method for Proving Lower Bounds |
Petr Jancar, Antonin Kucera,
Faron Moller, Zdenek Sawa |
| Verification for Java's Reentrant Multithreading Concept |
Erika Ábrahám-Mumm
Frank S. de Boer
Willem-Paul de Roever
Martin Steffen |
| Logics Admitting Final Semantics |
Alexander Kurz |
| On the Integration of Observability
and Reachability Concepts |
Michel Bidoit and
Rolf Hennicker |
| The informatic derivative at a compact element |
Keye Martin |
| On Compositional Reasoning in the Spi-Calculus |
Michele Boreale, Daniele Gorla |
| Higher-order pushdown trees are easy |
Teodor Knapik, Damian Niwinski, Pawel Urzyczyn |
| Minimizing Transition Systems for Name Passing
Calculi: A Co-algebraic Formulation |
Gianluigi Ferrari, Ugo Montanari, Marco Pistore |
| Linearity and Bisimulation |
Nobuko Yoshida, Kohei Honda and Martin Berger |
| A First-Order One-Pass CPS Transformation |
Olivier Danvy and Lasse R. Nielsen |
| Generalised Regular MSC Languages |
Benedikt Bollig, Martin Leucker, Thomas Noll |
