ESOP 2021
24 papers
- An Automated Deductive Verification Framework for Circuit-building Quantum Programs
- Automated Termination Analysis of Polynomial Probabilistic Programs
- Bayesian strategies: probabilistic programs as generalised graphical models
- Checking Robustness Between Weak Transactional Consistency Models
- Complete trace models of state and control
- Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages
- Coupled Relational Symbolic Execution for Differential Privacy
- Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains
- Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere
- Do Judge a Test by its Cover - Combining Combinatorial and Property-Based Testing
- For a Few Dollars More - Verified Fine-Grained Algorithm Analysis Down to LLVM
- Graded Hoare Logic and its Categorical Semantics
- Graded Modal Dependent Type Theory
- Nested Session Types
- Query Lifting - Language-integrated query for heterogeneous nested collections
- Reverse AD at Higher Types: Pure, Principled and Denotationally Correct
- Run-time Complexity Bounds Using Squeezers
- Session Coalgebras: A Coalgebraic View on Session Types and Communication Protocols
- Sound and Complete Concolic Testing for Higher-order Functions
- Strong-Separation Logic
- Temporal Refinements for Guarded Recursive Types
- The Decidability of Verification under PS 2.0
- Types for Complexity of Parallel Computation in Pi-Calculus
- Verified Software Units