Abstract is missing.
- Composable Transactional Objects: A Position PaperMaurice Herlihy, Eric Koskinen. 1-7 [doi]
- Application-Scale Secure Multiparty ComputationJohn Launchbury, Dave Archer, Thomas Dubuisson, Eric Mertens. 8-26 [doi]
- An Array-Oriented Language with Static Rank PolymorphismJustin Slepak, Olin Shivers, Panagiotis Manolios. 27-46 [doi]
- Gradual Typing for Annotated Type SystemsPeter Thiemann, Luminous Fennell. 47-66 [doi]
- Staged Composition SynthesisBoris Düdder, Moritz Martens, Jakob Rehof. 67-86 [doi]
- Overlapping and Order-Independent Patterns - Definitional Equality for AllJesper Cockx, Frank Piessens, Dominique Devriese. 87-106 [doi]
- Verified Compilation for Shared-Memory CLennart Beringer, Gordon Stewart, Robert Dockins, Andrew W. Appel. 107-127 [doi]
- Verifying an Open Compiler Using Multi-language SemanticsJames T. Perconti, Amal Ahmed. 128-148 [doi]
- Impredicative Concurrent Abstract PredicatesKasper Svendsen, Lars Birkedal. 149-168 [doi]
- Local Reasoning for the POSIX File SystemPhilippa Gardner, Gian Ntzik, Adam Wright. 169-188 [doi]
- A Coq Formalization of the Relational Data ModelVéronique Benzaken, Evelyne Contejean, Stefania Dumbrava. 189-208 [doi]
- On Probabilistic Applicative Bisimulation and Call-by-Value λ-CalculiRaphaëlle Crubillé, Ugo Dal Lago. 209-228 [doi]
- Grounding Synchronous Deterministic Concurrency in Sequential ProgrammingJoaquin Aguado, Michael Mendler, Reinhard von Hanxleden, Insa Fuhrmann. 229-248 [doi]
- The Duality of ConstructionPaul Downen, Zena M. Ariola. 249-269 [doi]
- Deriving Pretty-Big-Step Semantics from Small-Step SemanticsCasper Bach Poulsen, Peter D. Mosses. 270-289 [doi]
- Communicating State Transition Systems for Fine-Grained Concurrent ResourcesAleksandar Nanevski, Ruy Ley-Wild, Ilya Sergey, Germán Andrés Delbianco. 290-310 [doi]
- Checking Linearizability of Encapsulated Extended OperationsOren Zomer, Guy Golan-Gueta, G. Ramalingam, Mooly Sagiv. 311-330 [doi]
- Bounded Linear Types in a Resource SemiringDan R. Ghica, Alex I. Smith. 331-350 [doi]
- A Core Quantitative Coeffect CalculusAloïs Brunel, Marco Gaboardi, Damiano Mazza, Steve Zdancewic. 351-370 [doi]
- Measurements in Proof Nets as Higher-Order Quantum CircuitsAkira Yoshimizu, Ichiro Hasuo, Claudia Faggian, Ugo Dal Lago. 371-391 [doi]
- Automatic Termination Verification for Higher-Order Functional ProgramsTakuya Kuwahara, Tachio Terauchi, Hiroshi Unno, Naoki Kobayashi 0001. 392-411 [doi]
- An Abstract Domain to Infer Ordinal-Valued Ranking FunctionsCaterina Urban, Antoine Miné. 412-431 [doi]
- Model and Proof Generation for Heap-Manipulating ProgramsMartin Brain, Cristina David, Daniel Kroening, Peter Schrammel. 432-452 [doi]
- REAP: Reporting Errors Using Alternative PathsJoão Matos, João Garcia, Paolo Romano. 453-472 [doi]
- The Network as a Language ConstructTony Garnock-Jones, Sam Tobin-Hochstadt, Matthias Felleisen. 473-492 [doi]
- Resolving Non-determinism in ChoreographiesLaura Bocchi, Hernán C. Melgratti, Emilio Tuosto. 493-512 [doi]
- A Correspondence between Two Approaches to Interprocedural Analysis in the Presence of JoinRavi Mangal, Mayur Naik, Hongseok Yang. 513-533 [doi]
- Targeted Update - Aggressive Memory Abstraction Beyond Common Sense and Its Application on Static Numeric AnalysisZhoulai Fu. 534-553 [doi]
- Affine Parallelization of Loops with Run-Time Dependent Bounds from BinariesAparna Kotha, Kapil Anand, Timothy Creech, Khaled Elwazeer, Matthew Smithson, Rajeev Barua. 554-574 [doi]