Abstract is missing.
- Consistent Subtyping for AllNingning Xie, Xuan Bi, Bruno C. D. S. Oliveira. 3-30 [doi]
- HOBiT: Programming Lenses Without Using Lens CombinatorsKazutaka Matsuda, Meng Wang 0002. 31-59 [doi]
- Dualizing Generalized Algebraic Data Types by Matrix TranspositionKlaus Ostermann, Julian Jabs. 60-85 [doi]
- Deterministic Concurrency: A Clock-Synchronised Shared Memory ApproachJoaquín Aguado, Michael Mendler, Marc Pouzet, Partha S. Roop, Reinhard von Hanxleden. 86-113 [doi]
- An Assertion-Based Program Logic for Probabilistic ProgramsGilles Barthe, Thomas Espitau, Marco Gaboardi, Benjamin Grégoire, Justin Hsu, Pierre-Yves Strub. 117-144 [doi]
- Fine-Grained Semantics for Probabilistic ProgramsBenjamin Bichsel, Timon Gehr, Martin T. Vechev. 145-185 [doi]
- How long, O Bayesian network, will I sample thee? - A program analysis perspective on expected sampling timesKevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. 186-213 [doi]
- Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda CalculusAlejandro Aguirre 0001, Gilles Barthe, Lars Birkedal, Ales Bizjak, Marco Gaboardi, Deepak Garg 0001. 214-241 [doi]
- Failure is Not an Option - An Exceptional Type TheoryPierre-Marie Pédrot, Nicolas Tabareau. 245-271 [doi]
- Let Arguments Go FirstNingning Xie, Bruno C. D. S. Oliveira. 272-299 [doi]
- Behavioural Equivalence via Modalities for Algebraic EffectsAlex Simpson, Niels Voorneveld. 300-326 [doi]
- Explicit Effect SubtypingAmr Hany Saleh, Georgios Karachalias, Matija Pretnar, Tom Schrijvers. 327-354 [doi]
- A Separation Logic for a Promising SemanticsKasper Svendsen, Jean Pichon-Pharabod, Marko Doko, Ori Lahav, Viktor Vafeiadis. 357-384 [doi]
- Logical Reasoning for Disjoint PermissionsXuan Bach Le, Aquinas Hobor. 385-414 [doi]
- Deadlock-Free MonitorsJafar Hamin, Bart Jacobs 0002. 415-441 [doi]
- Fragment Abstraction for Concurrent Shape AnalysisParosh Aziz Abdulla, Bengt Jonsson, Cong Quy Trinh. 442-471 [doi]
- Reasoning About a Machine with Local Capabilities - Provably Safe Stack and Return Pointer ManagementLau Skorstengaard, Dominique Devriese, Lars Birkedal. 475-501 [doi]
- Modular Product ProgramsMarco Eilers, Peter Müller, Samuel Hitz. 502-529 [doi]
- A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program VerificationArmaël Guéneau, Arthur Charguéraud, François Pottier. 533-560 [doi]
- Verified Learning Without Regret - From Algorithmic Game Theory to Distributed Systems with Mechanized Complexity GuaranteesSamuel Merten, Alexander Bagnall, Gordon Stewart. 561-588 [doi]
- Program Verification by CoinductionBrandon M. Moore, Lucas Peña, Grigore Rosu. 589-618 [doi]
- Velisarios: Byzantine Fault-Tolerant Protocols Powered by CoqVincent Rahli, Ivana Vukotic, Marcus Völp, Paulo Jorge Esteves Veríssimo. 619-650 [doi]
- Evaluating Design Tradeoffs in Numeric Static Analysis for JavaShiyi Wei, Piotr Mardziel, Andrew Ruef, Jeffrey S. Foster, Michael Hicks 0001. 653-682 [doi]
- An Abstract Interpretation Framework for Input Data UsageCaterina Urban, Peter Müller. 683-710 [doi]
- Higher-Order Program Verification via HFL Model CheckingNaoki Kobayashi 0001, Takeshi Tsukada, Keiichi Watanabe. 711-738 [doi]
- Quantitative Analysis of Smart ContractsKrishnendu Chatterjee, Amir Kafshdar Goharshady, Yaron Velner. 739-767 [doi]
- Session-Typed Concurrent ContractsHannah Gommerstadt, Limin Jia, Frank Pfenning. 771-798 [doi]
- A Typing Discipline for Statically Verified Crash Failure Handling in Distributed SystemsMalte Viering, Tzu-Chun Chen, Patrick Eugster, Raymond Hu, Lukasz Ziarek. 799-826 [doi]
- On Polymorphic Sessions and Functions - A Tale of Two (Fully Abstract) EncodingsBernardo Toninho, Nobuko Yoshida. 827-855 [doi]
- Concurrent Kleene Algebra: Free Model and CompletenessTobias Kappé, Paul Brunet, Alexandra Silva 0001, Fabio Zanasi. 856-882 [doi]
- Correctness of a Concurrent Object Collector for Actor LanguagesJuliana Franco, Sylvan Clebsch, Sophia Drossopoulou, Jan Vitek, Tobias Wrigstad. 885-911 [doi]
- Paxos Consensus, Deconstructed and AbstractedÁlvaro García-Pérez, Alexey Gotsman, Yuri Meshman, Ilya Sergey. 912-939 [doi]
- On Parallel Snapshot Isolation and Release/Acquire ConsistencyAzalea Raad, Ori Lahav, Viktor Vafeiadis. 940-967 [doi]
- Eventual Consistency for CRDTsRadha Jagadeesan, James Riely. 968-995 [doi]
- A Verified Compiler from Isabelle/HOL to CakeMLLars Hupel, Tobias Nipkow. 999-1026 [doi]
- Compositional Verification of Compiler Optimisations on Relaxed MemoryMike Dodds, Mark Batty, Alexey Gotsman. 1027-1055 [doi]