| 1 | -- | 2 | Michael Goldsmith, Bill Roscoe. Preface |
| 3 | -- | 19 | Adam Antonik, Michael Huth. On the Complexity of Semantic Self-minimization |
| 21 | -- | 37 | Paolo Ballarini, András Horváth. Compositional Model Checking of product-form CTMCs |
| 39 | -- | 54 | Lyes Benalycherif, Anthony McIsaac. A Semantic Condition for Data Independence and Applications in Hardware Verification |
| 55 | -- | 70 | Jeremy Dawson. Isabelle Theories for Machine Words |
| 71 | -- | 86 | Harald Fecher, Michael Huth, Heiko Schmidt, Jens Schönborn. Refinement Sensitive Formal Semantics of State Machines With Persistent Choice |
| 87 | -- | 103 | Douglas Graham, Muffy Calder, Alice Miller. An Inductive Technique for Parameterised Model Checking of Degenerative Distributed Randomised Protocols |
| 105 | -- | 122 | Mohammad Izadi, Ali Movaghar. Compositional Failure-based Equivalence of Constraint Automata |
| 123 | -- | 136 | Jan Jürjens. Automated Security Verification for Crypto Protocol Implementations: Verifying the Jessie Project |
| 137 | -- | 152 | Rahul Kumar, Eric G. Mercer, Annette Bunker. Improving Translation of Live Sequence Charts to Temporal Logic |
| 153 | -- | 170 | Gavin Lowe. On CSP Refinement Tests That Run Multiple Copies of a Process |
| 171 | -- | 186 | Tomasz Mazur, Gavin Lowe. Counter Abstraction in the CSP/FDR setting |