ESOP 2025
32 papers
- A Complete Axiomatisation of Equivalence for Discrete Probabilistic Programming
- A Program Logic for Concurrent Randomized Programs in the Oblivious Adversary Model
- Abstraction of memory block manipulations by symbolic loop folding
- An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols
- An abstract, certified account of operational game semantics
- Artifact Report: an Abstract, Certified Account of Operational Game Semantics
- CUTECat: Concolic Execution for Computational Law
- Cognacy Queries over Dependence Graphs for Transparent Visualisations
- Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration
- Constructive characterisations of the MUST-preorder for asynchrony
- Context-Dependent Effects in Guarded Interaction Trees
- Context-Sensitive Demand-Driven Control-Flow Analysis
- Coverage Semantics for Dependent Pattern Matching
- Efficient Synthesis of Tight Polynomial Upper-Bounds for Systems of Conditional Polynomial Recurrences
- Elucidating Type Conversions in SQL Engines
- First-Person Choreographic Programming with Continuation-Passing Communications
- Formal Autograding in a Classroom
- Formal Verification of WTO-based Dataflow Solvers
- Formal Verification of WTO-based Dataflow Solvers - Artifact Experience Report
- Formulas as Processes, Deadlock-Freedom as Choreographies
- Iso-Recursive Multiparty Sessions and their Automated Verification
- Multiparty Session Types with a Bang!
- Named Arguments as Intersections, Optional Arguments as Unions
- Neural Network Verification is a Programming Language Challenge
- On the Relationship between Dijkstra Monads and Higher-Order Fixpoint Logic
- SMT-Boosted Security Types for Low-Level MPC
- Stratified Type Theory
- Sufficient Conditions for Robustness of RDMA Programs
- The Vanilla Sequent Calculus is Call-by-Value
- Variable Elimination as Rewriting in a Linear Lambda Calculus
- Verifying Algorithmic Versions of the Lovász Local Lemma
- coma, an Intermediate Verification Language with Explicit Abstraction Barriers