Simplifying Linearizability Proofs with Reduction and Abstraction
No abstract available.
Related papers
- Proof Automation for Linearizability in Separation Logic OOPSLA 2023
- nekton: A Linearizability Proof Checker CAV 2023
- The Path to Durable Linearizability POPL 2023
- Go with the flow: compositional abstractions for concurrent data structures POPL 2018
- Commutativity Simplifies Proofs of Parameterized Programs POPL 2024
- Proving highly-concurrent traversals correct OOPSLA 2020
- On the Complexity of Checking Soundness of Natural Reductions CAV 2026
- Efficient Linearizability Monitoring PLDI 2025