Abstract is missing.
- Probabilistic Relational Hoare Logics for Computer-Aided Security ProofsGilles Barthe, Benjamin Grégoire, Santiago Zanella Béguelin. 1-6 [doi]
- The Laws of Programming Unify Process CalculiTony Hoare, Stephan van Staden. 7-22 [doi]
- The Geometry of Synthesis - How to Make Hardware Out of SoftwareDan R. Ghica. 23-24 [doi]
- Scheduler-Independent DeclassificationAlexander Lux, Heiko Mantel, Matthias Perner. 25-47 [doi]
- Elementary Probability Theory in the Eindhoven StyleCarroll Morgan. 48-73 [doi]
- Scheduling and Buffer Sizing of n-Synchronous Systems - Typing of Ultimately Periodic Clocks in Lucy-nLouis Mandel, Florence Plateau. 74-101 [doi]
- Deriving Real-Time Action Systems Controllers from Multiscale System SpecificationsBrijesh Dongol, Ian J. Hayes. 102-131 [doi]
- Calculating Graph Algorithms for Dominance and Shortest PathIlya Sergey, Jan Midtgaard, Dave Clarke. 132-156 [doi]
- First-Past-the-Post GamesRoland Carl Backhouse. 157-176 [doi]
- Reverse Exchange for Concurrency and Local ReasoningHan-Hing Dang, Bernhard Möller. 177-197 [doi]
- Unifying Correctness StatementsWalter Guttmann. 198-219 [doi]
- Dependently Typed Programming Based on Automated Theorem ProvingAlasdair Armstrong, Simon Foster, Georg Struth. 220-240 [doi]
- An Algebraic Calculus of Database PreferencesBernhard Möller, Patrick Roocks, Markus Endres. 241-262 [doi]
- Modular Tree AutomataPatrick Bahr. 263-299 [doi]
- Constructing Applicative FunctorsRoss Paterson. 300-323 [doi]
- Kan Extensions for Program Optimisation Or: Art and Dan Explain an Old TrickRalf Hinze. 324-362 [doi]