A static analysis of CSP programs -- Compactness in semantics for merge and fair merge -- Algebraic tools for system construction -- PC-compactness, a necessary condition for the existence of sound and complete logics of partial correctness -- The intractability of validity in logic programming and dynamic logic -- A semantics and proof system for communicating processes -- Non-standard fixed points in first order logic -- Automatic verification of asynchronous circuits -- Mathematics as programming -- Characterization of acceptable by algol-like programming languages -- A rigorous approach to fault-tolerant system development -- A sound and relatively complete axiomatization of clarke's language L4 -- Deciding branching time logic: A triple exponential decision procedure for CTL -- Equations in combinatory algebras -- Reasoning about procedures as parameters -- Introducing institutions -- A complete proof rule for strong equifair termination -- Necessary and sufficient conditions for the universality of programming formalisms -- There exist decidable context free propositonal dynamic logics -- A decision procedure for the propositional ?-calculus -- A verifier for compact parallel coordination programs -- Information systems, continuity and realizability -- A complete system of temporal logic for specification schemata -- Reasoning in interval temporal logic -- Hoare's logic for programs with procedures — What has been achieved? -- A theory of probabilistic programs -- A low level language for obtaining decision procedures for classes of temporal logics -- Deriving efficient graph algorithms (summary) -- An introduction to specification logic -- An interval-based temporal logic -- Property preserving homomorphisms of transition systems -- From denotational to operational and axiomatic semantics for ALGOL-like languages: An overview -- Yet another process logic -- A proof system for partial correctness of dynamic networks of processes -- Errata.