Proving Linearizability Via Non-atomic Refinement
Authors:
- 13 September 2007
- book chapter
- Published by Springer Nature
- p. 195-214
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Derivation of a Scalable Lock-Free Stack AlgorithmElectronic Notes in Theoretical Computer Science, 2007
- Refinement and Reachability in Event_BLecture Notes in Computer Science, 2005
- A scalable lock-free stack algorithm2004
- Formal Verification of a Practical Lock-Free Queue Algorithm2004
- Using Coupled Simulations in Non-atomic Refinement2003
- Specifying and Refining Internal Operations in ZFormal Aspects of Computing, 1998
- CSP-OZ: A Combination of Object-Z and CSP1997
- Object-Z: A specification language advocated for the description of standardsComputer Standards & Interfaces, 1995
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- ReductionCommunications of the ACM, 1975