Comparison Under Abstraction for Verifying Linearizability
- 29 August 2007
- book chapter
- Published by Springer Nature
- p. 477-490
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Proving correctness of highly-concurrent linearisable objects2006
- Formal Verification of a Lazy Concurrent List-Based Set Algorithm2006
- Automatic Termination Proofs for Programs with Shape-Shifting Heaps2006
- Static analysis of atomicity for programs with non-blocking synchronization2005
- Hazard pointers: safe memory reclamation for lock-free objectsIEEE Transactions on Parallel and Distributed Systems, 2004
- Parametric shape analysis via 3-valued logicACM Transactions on Programming Languages and Systems, 2002
- Verifying safety properties of concurrent Java programs using 3-valued logic2001
- Simple, fast, and practical non-blocking and blocking concurrent queue algorithms1996
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990