Abstract is missing.
- Howard Barringer: the Man who Invented the PastKlaus Havelund. 1-12 [doi]
- Model checking Timed CSPPhilip J. Armstrong, Gavin Lowe, Joël Ouaknine, Bill Roscoe. 13-33 [doi]
- A Design Space and its Patterns: Modelling 2phase Asynchronous PipelinesGraham M. Birtwistle, Kenneth S. Stevens. 34-65 [doi]
- Cognition, Concurrency Theory and Reverberations in the Brain: in Search of a Calculus of Communicating (Recurrent) Neural SystemsHoward Bowman, Li Su. 66-84 [doi]
- On and On the Temporal WayClare Dixon, Michael Fisher. 85-111 [doi]
- On the Expressiveness of some Runtime Validation TechniquesYliès Falcone, Jean-Claude Fernandez, Laurent Mounier. 112-123 [doi]
- Can a system learn from interactive proofs?Leo Freitas, Cliff B. Jones, Andrius Velykis. 124-139 [doi]
- The Handling of Loops in Talmudic Logic, with Application to Odd and Even Loops in ArgumentationMichael Abraham, Dov M. Gabbay, Uri J. Schild. 140-164 [doi]
- A simple and complete model theory for intensional and extensional untyped λ-equalityMichael Gabbay. 165-177 [doi]
- Stone duality for first-order logic: a nominal approach to logic and topologyMurdoch James Gabbay. 178-209 [doi]
- Closing the Gap Between Specification and Programming: VDM++ and ScalaKlaus Havelund. 210-233 [doi]
- Model Check What You Can, Runtime Verify the RestTimothy L. Hinrichs, A. Prasad Sistla, Lenore D. Zuck. 234-244 [doi]
- On Incremental Quantitative Verification for Probabilistic SystemsMarta Z. Kwiatkowska, David Parker, Hongyang Qu, Mateusz Ujma. 245-257 [doi]
- Pandora's BoxRonald Middelkoop, Cornelis Huizing, Ruurd Kuiper, Erik J. Luit. 258-270 [doi]
- Distributed Control SynthesisDoron Peled, Sven Schewe. 271-288 [doi]
- A note on first-order reasoning for minimum modelsDavid E. Rydeheard, Jesús Héctor Domínguez Sánchez. 289-305 [doi]
- A Tableau Proof System with Names for Modal Mu-calculusColin Stirling. 306-318 [doi]
- Extended Abstract: Getting EngagedSimon Thompson. 319 [doi]