A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures

Schellhorn, G., Derrick, J. and Wehrheim, H. (2014) A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures. ACM Transactions on Computational Logic, 15 (4). 31. ISSN 1529-3785

Abstract

Metadata

Authors/Creators:
  • Schellhorn, G.
  • Derrick, J.
  • Wehrheim, H.
Copyright, Publisher and Additional Information: © ACM, 2014. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Computational Logic, 15, 4, Aug 2014 http://doi.acm.org/10.1145/2629496
Keywords: Algorithms; Verification; Z; refinement; concurrent access; linearizability; nonatomic refinement; theorem proving; KIV
Dates:
  • Published: August 2014
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 29 Oct 2015 17:50
Last Modified: 22 Mar 2018 19:20
Published Version: https://dx.doi.org/10.1145/2629496
Status: Published
Publisher: Association for Computing Machinery
Refereed: Yes
Identification Number: https://doi.org/10.1145/2629496
Related URLs:

Share / Export

Statistics