1 Invited lecture Extended static checking. - 2 Invited lecture From lattices to practical formal hardware verification. - 3 Invited lecture Programming with tabling in XSB. - 4 Invited lecture Verifying electronic control units: today and tomorrow. - 5 Educational session Teaching calculational logic. - 6 Types for trees. - 7 Structures for lazy semantics. - 8 A proof theory of asynchronously communicating sequential processes. - 9 Bisimulations in the join-calculus. - 10 Using state space exploration and a natural deduction style message derivation engine to verify security protocols. - 11 Programming language semantics in foundational type theory. - 12 An algebraic approach to the specification of stochastic systems. - 13 Refinement types for specification. - 14 An extension of the program derivation format. - 15 Deadlines are termination. - 16 The design of a linearization of a concurrent data object. - 17 Final semantics for the pi-calculus. - 18 Comparing CTL and PCTL on labeled Markov chains. - 19 Reactive functional programming. - 20 Imperative objects and mobile processes. - 21 Relating linear and branching model checking. - 22 Verifying duration properties of timed transition systems. - 23 Towards squiggly refinement algebra. - 24 Towards a theory of sequential hybrid programs. - 25 Test selection for object-oriented software based on formal specifications. - 26 Logical foundations for typed object-oriented languages. - 27 Verifying a self-stabilizing mutual exclusion algorithm. - 28 A combination of interval logic and linear temporal logic. - 29 A model of real-time distributed systems. - Index of contributors. - Keyword index. Language: English