Type-Based Deadlock-Freedom Verification for Non-Block-Structured Lock Primitives and Mutable References
No abstract available.
Related papers
- A program logic for concurrent objects under fair scheduling POPL 2016
- Reference Capabilities for Concurrency Control ECOOP 2016
- A hybrid type system for lock-freedom of mobile processes TOPLAS 2010
- A Family of Fast and Memory Efficient Lock- and Wait-Free Reclamation PLDI 2024
- Unexpected Scaling in Path Copying Trees PPoPP 2023
- Proving that non-blocking algorithms don't block POPL 2009
- An ownership policy and deadlock detector for promises PPoPP 2021
- Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing POPL 2024