Front matter
642
Security Protocols and Specifications
Martín Abadi
642
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
Javier Esparza and Jens Knoop
642
Reasoning about Concurrent Systems Using Types
Davide Sangiorgi
642
Testing Hennessy-Milner Logic with Recursion
Luca Aceto and Anna Ingólfsdóttir
642
A Strong Logic Programming View for Static Embedded Implications
R. Arruabarrena, P. Lucio and M. Navarro
641
Unfolding and Event Structure Semantics for Graph Grammars
Paolo Baldan, Andrea Corradini and Ugo Montanari
642
Expanding the Cube
Gilles Barthe
641
An Algebraic Characterization of Typability in ML with Subtyping
Marcin Benke
641
Static Analysis of Processes for No Read-Up and No Write-Down
Chiara Bodei, Pierpaolo Degano, Flemming Nielson and Hanne Riis Nielson
135-140
A WP-calculus for OO
F. S de Boer
642
The Recognizability Problem for Tree Automata with Comparisons between Brothers
Bruno Bogaert, Franck Seynhaeve and Sophie Tison
643
A Theory of “May” Testing for Asynchronous Languages
Michele Boreale, Rocco De Nicola and Rosario Pugliese
67
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees
Evgeny Dantsin and Andrei Voronkov
641
Categorical Models of Explicit Substitutions
Neil Ghani, Valeria de Paiva and Eike Ritter
642
Equational Properties of Mobile Ambients
Andrew D. Gordon and Luca Cardelli
641
Model Checking Logics for Communicating Sequential Agents
Michaela Huhn, Peter Niebert and Frank Wallner
67
A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects
Marina Lenisa
642
String Languages Generated by Total Deterministic Macro Tree Transducers
Sebastian Maneth
642
Matching Specifications for Message Sequence Charts
Anca Muscholl
641
Probabilistic Temporal Logics via the Modal Mu-Calculus
Murali Narasimha, Rance Cleaveland and Purush Iyer
643
A π-calculus Process Semantics of Concurrent Idealised ALGOL
Christine Röckl and Davide Sangiorgi
Back matter