Compositional Termination Proofs for Multi-threaded Programs
No abstract available.
Related papers
- Modular verification of concurrent assembly code with dynamic thread creation and termination ICFP 2005
- Context-bounded verification of liveness properties for multithreaded shared-memory programs POPL 2021
- Causal Termination of Multi-threaded Programs CAV 2014
- A compositional theory for STM Haskell Haskell 2009
- CompCertOC: Verified Compositional Compilation of Multi-threaded Programs with Shared Stacks PLDI 2025
- Compositional optimizations for CertiCoq ICFP 2021
- Thread modularity at many levels: a pearl in compositional verification POPL 2017
- Predicate abstraction and refinement for verifying multi-threaded programs POPL 2011