Abstract is missing.
- The Decidability of Verification under PS 2.0Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole, Shankara Narayanan Krishna, Viktor Vafeiadis. 1-29 [doi]
- Data Flow Analysis of Asynchronous Systems using Infinite Abstract DomainsSnigdha Athaiya, Raghavan Komondoor, K. Narayan Kumar. 30-58 [doi]
- Types for Complexity of Parallel Computation in Pi-CalculusPatrick Baillot, Alexis Ghyselen. 59-86 [doi]
- Checking Robustness Between Weak Transactional Consistency ModelsSidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea. 87-117 [doi]
- Verified Software UnitsLennart Beringer. 118-147 [doi]
- An Automated Deductive Verification Framework for Circuit-building Quantum ProgramsChristophe Chareton, Sébastien Bardin, François Bobot, Valentin Perrelle, Benoît Valiron. 148-177 [doi]
- Nested Session TypesAnkush Das, Henry DeYoung, Andreia Mordido, Frank Pfenning. 178-206 [doi]
- Coupled Relational Symbolic Execution for Differential PrivacyGian Pietro Farina, Stephen Chong, Marco Gaboardi. 207-233 [doi]
- Graded Hoare Logic and its Categorical SemanticsMarco Gaboardi, Shin-ya Katsumata, Dominic Orchard, Tetsuya Sato. 234-263 [doi]
- Do Judge a Test by its Cover - Combining Combinatorial and Property-Based TestingHarrison Goldstein, John Hughes, Leonidas Lampropoulos, Benjamin C. Pierce. 264-291 [doi]
- For a Few Dollars More - Verified Fine-Grained Algorithm Analysis Down to LLVMMaximilian P. L. Haslbeck, Peter Lammich. 292-319 [doi]
- Run-time Complexity Bounds Using SqueezersOren Ish-Shalom, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham. 320-347 [doi]
- Complete trace models of state and controlGuilhem Jaber, Andrzej S. Murawski. 348-374 [doi]
- Session Coalgebras: A Coalgebraic View on Session Types and Communication ProtocolsAlex C. Keizer, Henning Basold, Jorge A. Pérez 0001. 375-403 [doi]
- Correctness of Sequential Monte Carlo Inference for Probabilistic Programming LanguagesDaniel Lundén, Johannes Borgström, David Broman. 404-431 [doi]
- Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost EverywhereCarol Mak, C.-H. Luke Ong, Hugo Paquet, Dominik Wagner. 432-461 [doi]
- Graded Modal Dependent Type TheoryBenjamin Moon, Harley Eades III, Dominic Orchard. 462-490 [doi]
- Automated Termination Analysis of Polynomial Probabilistic ProgramsMarcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács. 491-518 [doi]
- Bayesian strategies: probabilistic programs as generalised graphical modelsHugo Paquet. 519-547 [doi]
- Temporal Refinements for Guarded Recursive TypesGuilhem Jaber, Colin Riba. 548-578 [doi]
- Query Lifting - Language-integrated query for heterogeneous nested collectionsWilmer Ricciotti, James Cheney. 579-606 [doi]
- Reverse AD at Higher Types: Pure, Principled and Denotationally CorrectMatthijs Vákár. 607-634 [doi]
- Sound and Complete Concolic Testing for Higher-order FunctionsShu-Hung You, Robert Bruce Findler, Christos Dimoulas. 635-663 [doi]
- Strong-Separation LogicJens Pagel, Florian Zuleger. 664-692 [doi]