Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs
No abstract available.
Related papers
- Automated Verification of Parametric Channel-Based Process Communication OOPSLA 2024
- A program logic for concurrent objects under fair scheduling POPL 2016
- Verifying Deadlock-Freedom of Communication Fabrics VMCAI 2011
- Deadlock-Free Monitors ESOP 2018
- Deadlock-freedom-by-design: multiparty asynchronous global programming POPL 2013
- Using Symbolic Execution for Verification of Ada Tasking Programs TOPLAS 1990
- Progress of concurrent objects with partial methods POPL 2018
- A hybrid type system for lock-freedom of mobile processes TOPLAS 2010