Abstract is missing.
- Distributed Electronic Rights in JavaScriptMark S. Miller, Tom Van Cutsem, Bill Tulloh. 1-20 [doi]
- The Compiler ForestMihai Budiu, Joel Galenson, Gordon D. Plotkin. 21-40 [doi]
- Pretty-Big-Step SemanticsArthur Charguéraud. 41-60 [doi]
- Language Constructs for Non-Well-Founded ComputationJean-Baptiste Jeannin, Dexter Kozen, Alexandra Silva. 61-80 [doi]
- Laziness by NeedStephen Chang. 81-100 [doi]
- FliPpr: A Prettier Invertible Printing SystemKazutaka Matsuda, Meng Wang. 101-120 [doi]
- Slicing-Based Trace Analysis of Rewriting Logic Specifications with iJulienneMaría Alpuente, Demis Ballis, Francisco Frechina, Julia Sapiña. 121-124 [doi]
- Why3 - Where Programs Meet ProversJean-Christophe Filliâtre, Andrei Paskevich. 125-128 [doi]
- Compositional Invariant Checking for Overlaid and Nested Linked ListsConstantin Enea, Vlad Saveluc, Mihaela Sighireanu. 129-148 [doi]
- A Discipline for Program Verification Based on Backpointers and Its Use in Observational DisjointnessIoannis T. Kassios, Eleftherios Kritikos. 149-168 [doi]
- Modular Reasoning about Separation of Concurrent Data StructuresKasper Svendsen, Lars Birkedal, Matthew J. Parkinson. 169-188 [doi]
- Ribbon Proofs for Separation LogicJohn Wickerson, Mike Dodds, Matthew J. Parkinson. 189-208 [doi]
- Abstract Refinement TypesNiki Vazou, Patrick Maxim Rondon, Ranjit Jhala. 209-228 [doi]
- Constraining Delimited Control with ContractsAsumu Takikawa, T. Stephen Strickland, Sam Tobin-Hochstadt. 229-248 [doi]
- Verifying Concurrent Memory Reclamation Algorithms with GraceAlexey Gotsman, Noam Rinetzky, Hongseok Yang. 249-269 [doi]
- Interleaving and Lock-Step Semantics for Analysis and Verification of GPU KernelsPeter Collingbourne, Alastair F. Donaldson, Jeroen Ketema, Shaz Qadeer. 270-289 [doi]
- Verifying Concurrent Programs against Sequential SpecificationsAhmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza. 290-309 [doi]
- On Distributability in Process CalculiKirstin Peters, Uwe Nestmann, Ursula Goltz. 310-329 [doi]
- Behavioral Polymorphism and Parametricity in Session-Based CommunicationLuís Caires, Jorge A. Pérez, Frank Pfenning, Bernardo Toninho. 330-349 [doi]
- Higher-Order Processes, Functions, and Sessions: A Monadic IntegrationBernardo Toninho, Luís Caires, Frank Pfenning. 350-369 [doi]
- Concurrent Flexible ReversibilityIvan Lanese, Michael Lienhardt, Claudio Antares Mezzina, Alan Schmitt, Jean-Bernard Stefani. 370-390 [doi]
- Structural Lock Correlation with Ownership TypesYi Lu 0003, John Potter, Jingling Xue. 391-410 [doi]
- Taming Confusion for Modeling and Implementing Probabilistic Concurrent SystemsJoost-Pieter Katoen, Doron Peled. 411-430 [doi]
- Model-Checking Higher-Order Programs with Recursive TypesNaoki Kobayashi 0001, Atsushi Igarashi. 431-450 [doi]
- Counterexample-Guided Precondition InferenceMohamed Nassim Seghir, Daniel Kroening. 451-471 [doi]
- Information Reuse for Multi-goal Reachability AnalysesDirk Beyer, Andreas Holzer, Michael Tautschnig, Helmut Veith. 472-491 [doi]
- Quarantining Weakness - Compositional Reasoning under Relaxed Memory Models (Extended Abstract)Radha Jagadeesan, Gustavo Petri, Corin Pitcher, James Riely. 492-511 [doi]
- Software Verification for Weak Memory via Program TransformationJade Alglave, Daniel Kroening, Vincent Nimal, Michael Tautschnig. 512-532 [doi]
- Checking and Enforcing Robustness against TSOAhmed Bouajjani, Egor Derevenetc, Roland Meyer. 533-553 [doi]
- GADTs Meet SubtypingGabriel Scherer, Didier Rémy. 554-573 [doi]
- A Data Driven Approach for Algebraic Loop InvariantsRahul Sharma 0001, Saurabh Gupta, Bharath Hariharan, Alex Aiken, Percy Liang, Aditya V. Nori. 574-592 [doi]
- Automatic Type Inference for Amortised Heap-Space AnalysisMartin Hofmann, Dulma Rodriguez. 593-613 [doi]