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

G. Schellhorn, J. Derrick, H. Wehrheim, {ACM} Trans. Comput. Log. (2014) 31:1--31:37.

Download
No fulltext has been uploaded.
Journal Article
Author
; ;
Publishing Year
Journal Title
{ACM} Trans. Comput. Log.
Issue
4
Page
31:1--31:37
LibreCat-ID

Cite this

Schellhorn G, Derrick J, Wehrheim H. A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures. {ACM} Trans Comput Log. 2014;(4):31:1--31:37. doi:10.1145/2629496
Schellhorn, G., Derrick, J., & Wehrheim, H. (2014). A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures. {ACM} Trans. Comput. Log., (4), 31:1--31:37. https://doi.org/10.1145/2629496
@article{Schellhorn_Derrick_Wehrheim_2014, title={A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures}, DOI={10.1145/2629496}, number={4}, journal={{ACM} Trans. Comput. Log.}, author={Schellhorn, Gerhard and Derrick, John and Wehrheim, Heike}, year={2014}, pages={31:1--31:37} }
Schellhorn, Gerhard, John Derrick, and Heike Wehrheim. “A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures.” {ACM} Trans. Comput. Log., no. 4 (2014): 31:1--31:37. https://doi.org/10.1145/2629496.
G. Schellhorn, J. Derrick, and H. Wehrheim, “A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures,” {ACM} Trans. Comput. Log., no. 4, pp. 31:1--31:37, 2014.
Schellhorn, Gerhard, et al. “A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures.” {ACM} Trans. Comput. Log., no. 4, 2014, pp. 31:1--31:37, doi:10.1145/2629496.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar