Practical proofs of concurrent programs
Abstract
No abstract available.
DOI 10.1145/1159803.1159819
Related papers
- Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach POPL 1983
- A Lazy, Concurrent Convertibility Checker POPL 2026
- PulseCore: An Impredicative Concurrent Separation Logic for Dependently Typed Programs PLDI 2025
- Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications TOPLAS 1986
- Mechanized verification of preemptive OS kernels (invited talk) CPP 2017
- Mechanized verification of a fine-grained concurrent queue from meta's folly library CPP 2022
- Synthesis of concurrent programs for an atomic read/write model of computation TOPLAS 2001
- The Ghosts of Empires: Extracting Modularity from Interleaving-Based Proofs POPL 2026