Abstract is missing.
- Types for Deadlock-Free Higher-Order ProgramsLuca Padovani, Luca Novara. 3-18 [doi]
- On Partial Order Semantics for SAT/SMT-Based Symbolic Encodings of Weak Memory ConcurrencyAlex Horn, Daniel Kroening. 19-34 [doi]
- A Strategy for Automatic Verification of Stabilization of Distributed AlgorithmsRitwika Ghosh, Sayan Mitra. 35-49 [doi]
- Faster Linearizability Checking via P-CompositionalityAlex Horn, Daniel Kroening. 50-65 [doi]
- Translation Validation for Synchronous Data-Flow Specification in the SIGNAL CompilerVan Chan Ngo, Jean-Pierre Talpin, Thierry Gautier. 66-80 [doi]
- Dynamic Causality in Event StructuresYoussef Arbach, David Karcher, Kirstin Peters, Uwe Nestmann. 83-97 [doi]
- Loop Freedom in AODVv2Kedar S. Namjoshi, Richard J. Trefler. 98-112 [doi]
- Code Mobility Meets Self-organisation: A Higher-Order Calculus of Computational FieldsFerruccio Damiani, Mirko Viroli, Danilo Pianini, Jacob Beal. 113-128 [doi]
- Timely Dataflow: A ModelMartín Abadi, Michael Isard. 131-145 [doi]
- Difference Bound Constraint Abstraction for Timed Automata Reachability CheckingWeifeng Wang, Li Jiao. 146-160 [doi]
- Compliance and Subtyping in Timed Session TypesMassimo Bartoletti, Tiziana Cimoli, Maurizio Murgia, Alessandro Sebastian Podda, Livio Pompianu. 161-177 [doi]
- Type Checking Privacy Policies in the π-calculusDimitrios Kouzapas, Anna Philippou. 181-195 [doi]
- Extending Testing Automata to All LTLAla-Eddine Ben Salem. 196-210 [doi]
- Simple Isolation for an Actor Abstract MachineBenoit Claudel, Quentin Sabah, Jean-Bernard Stefani. 213-227 [doi]
- Sliced Path Prefixes: An Effective Method to Enable Refinement SelectionDirk Beyer 0001, Stefan Löwe, Philipp Wendler. 228-243 [doi]