TOPLAS 2021
21 papers
- A Fresh Look at Zones and Octagons
- A Lightweight Formalism for Reference Lifetimes and Borrowing in Rust
- A Programming Language for Data Privacy with Accuracy Estimations
- Active Learning for Inference and Regeneration of Applications that Access Databases
- An Extended Account of Trace-relating Compiler Correctness and Secure Compilation
- Armed Cats: Formal Concurrency Modelling at Arm
- CSim2: Compositional Top-down Verification of Concurrent Systems using Rely-Guarantee
- Chocola: Composable Concurrency Language
- Completeness and Complexity of Reasoning about Call-by-Value in Hoare Logic
- Compositional Programming
- Interprocedural Context-Unbounded Program Analysis Using Observation Sequences
- Introduction to the Special Section on ESOP 2020
- On Polymorphic Sessions and Functions: A Tale of Two (Fully Abstract) Encodings
- Polymorphic Iterable Sequential Effect Systems
- Ranking and Repulsing Supermartingales for Reachability in Randomized Programs
- Robustly Safe Compilation, an Efficient Form of Secure Compilation
- RustHorn: CHC-based Verification for Rust Programs
- Safe-by-default Concurrency for Modern Programming Languages
- Securing Interruptible Enclaved Execution on Small Microprocessors
- Semantic Correctness of Dependence-based Slicing for Interprocedural, Possibly Nonterminating Programs
- TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs