Verifying Deadlock-Freedom of Communication Fabrics
No abstract available.
Related papers
- A hybrid type system for lock-freedom of mobile processes TOPLAS 2010
- Deadlock-freedom-by-design: multiparty asynchronous global programming POPL 2013
- Automated Verification of Parametric Channel-Based Process Communication OOPSLA 2024
- Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs VMCAI 2005
- DafnyMPI: A Dafny Library for Verifying Message-Passing Concurrent Programs POPL 2026
- Deadlock-free session types in linear Haskell Haskell 2021
- A program logic for concurrent objects under fair scheduling POPL 2016
- First-Person Choreographic Programming with Continuation-Passing Communications ESOP 2025