A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures (2014)
Attributed to:
Verifying Concurrent Lock-free Algorithms
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1145/2629496
Publication URI: http://dx.doi.org/10.1145/2629496
Type: Journal Article/Review
Parent Publication: ACM Transactions on Computational Logic
Issue: 4