Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties
No abstract available.
Related papers
- A program logic for concurrent objects under fair scheduling POPL 2016
- Verification of safety properties for concurrent assembly code ICFP 2004
- Using Symbolic Execution for Verification of Ada Tasking Programs TOPLAS 1990
- Deadlock Verification via Ordering-Constrained Mutex Modeling CAV 2026
- Progress of concurrent objects with partial methods POPL 2018
- Nagini: A Static Verifier for Python CAV 2018
- Automated Verification of Parametric Channel-Based Process Communication OOPSLA 2024
- Mostly Automated Verification of Liveness Properties for Distributed Protocols with Ranking Functions POPL 2024