Linked e-resources
Details
Table of Contents
The Decidability of Verification under PS 2.0
Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains
Types for Complexity of Parallel Computation in Pi-Calculus
Checking Robustness Between Weak Transactional Consistency Models
Verified Software Units
An Automated Deductive Verication Framework for Circuit-building Quantum Programs
Nested Session Types
Coupled Relational Symbolic Execution for Differential Privacy
Graded Hoare Logic and its Categorical Semantics
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
Run-time Complexity Bounds Using Squeezers
Complete trace models of state and control
Session Coalgebras: A Coalgebraic View on Session Types and Communication Protocols
Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages
Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere
Graded Modal Dependent Type Theory
Automated Termination Analysis of Polynomial Probabilistic Programs
Bayesian strategies: probabilistic programs as generalised graphical models
Temporal Refinements for Guarded Recursive Types
Query Lifting: Language-integrated query for heterogeneous nested collections
Reverse AD at Higher Types: Pure, Principled and Denotationally Correct
Sound and Complete Concolic Testing for Higher-order Functions
Strong-Separation Logic.
Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains
Types for Complexity of Parallel Computation in Pi-Calculus
Checking Robustness Between Weak Transactional Consistency Models
Verified Software Units
An Automated Deductive Verication Framework for Circuit-building Quantum Programs
Nested Session Types
Coupled Relational Symbolic Execution for Differential Privacy
Graded Hoare Logic and its Categorical Semantics
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
Run-time Complexity Bounds Using Squeezers
Complete trace models of state and control
Session Coalgebras: A Coalgebraic View on Session Types and Communication Protocols
Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages
Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere
Graded Modal Dependent Type Theory
Automated Termination Analysis of Polynomial Probabilistic Programs
Bayesian strategies: probabilistic programs as generalised graphical models
Temporal Refinements for Guarded Recursive Types
Query Lifting: Language-integrated query for heterogeneous nested collections
Reverse AD at Higher Types: Pure, Principled and Denotationally Correct
Sound and Complete Concolic Testing for Higher-order Functions
Strong-Separation Logic.