Foundations of Software Science and Computation Structures

Security Protocols and Specifications.- An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis.- Reasoning about Concurrent Systems Using Types.- Testing Hennessy-Milner Logic with Recursion.- A Strong Logic Programming View for Static Embedded Implications.- Unfolding and Event Structure Semantics for Graph Grammars.- Expanding the Cube.- An Algebraic Characterization of Typability in ML with Subtyping.- Static Analysis of Processes for No Read-Up and No Write-Down.- A WP-calculus for OO.- The Recognizability Problem for Tree Automata with Comparisons between Brothers.- A Theory of “May” Testing for Asynchronous Languages.- A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees.- Categorical Models of Explicit Substitutions.- Equational Properties of Mobile Ambients.- Model Checking Logics for Communicating Sequential Agents.- A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects.- String Languages Generated by Total Deterministic Macro Tree Transducers.- Matching Specifications for Message Sequence Charts.- Probabilistic Temporal Logics via the Modal Mu-Calculus.- A ?-calculus Process Semantics of Concurrent Idealised ALGOL.