Detecting Fair Non-termination in Multithreaded Programs
No abstract available.
Related papers
- Context-bounded verification of liveness properties for multithreaded shared-memory programs POPL 2021
- Verifying liveness for asynchronous programs POPL 2009
- Recurrence Sets for Proving Fair Non-termination under Axiomatic Memory Consistency Models POPL 2026
- Automatically disproving fair termination of higher-order functional programs ICFP 2016
- HFL(Z) Validity Checking for Automated Program Verification POPL 2023
- Fair Termination for Parameterized Probabilistic Concurrent Systems TACAS 2017
- Verifying Almost-Sure Termination for Randomized Distributed Algorithms POPL 2026
- Tree Schemata and Fair Termination SAS 2000