{"issue":"4","doi":"10.1145/2629496","page":"31:1--31:37","publication":"{ACM} Trans. Comput. Log.","type":"journal_article","date_updated":"2022-01-06T06:59:01Z","status":"public","year":"2014","author":[{"full_name":"Schellhorn, Gerhard","last_name":"Schellhorn","first_name":"Gerhard"},{"first_name":"John","last_name":"Derrick","full_name":"Derrick, John"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"department":[{"_id":"77"}],"title":"A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures","_id":"3169","citation":{"bibtex":"@article{Schellhorn_Derrick_Wehrheim_2014, title={A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures}, DOI={<a href=\"https://doi.org/10.1145/2629496\">10.1145/2629496</a>}, number={4}, journal={{ACM} Trans. Comput. Log.}, author={Schellhorn, Gerhard and Derrick, John and Wehrheim, Heike}, year={2014}, pages={31:1--31:37} }","ama":"Schellhorn G, Derrick J, Wehrheim H. A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures. <i>{ACM} Trans Comput Log</i>. 2014;(4):31:1--31:37. doi:<a href=\"https://doi.org/10.1145/2629496\">10.1145/2629496</a>","mla":"Schellhorn, Gerhard, et al. “A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures.” <i>{ACM} Trans. Comput. Log.</i>, no. 4, 2014, pp. 31:1--31:37, doi:<a href=\"https://doi.org/10.1145/2629496\">10.1145/2629496</a>.","ieee":"G. Schellhorn, J. Derrick, and H. Wehrheim, “A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures,” <i>{ACM} Trans. Comput. Log.</i>, no. 4, pp. 31:1--31:37, 2014.","chicago":"Schellhorn, Gerhard, John Derrick, and Heike Wehrheim. “A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures.” <i>{ACM} Trans. Comput. Log.</i>, no. 4 (2014): 31:1--31:37. <a href=\"https://doi.org/10.1145/2629496\">https://doi.org/10.1145/2629496</a>.","short":"G. Schellhorn, J. Derrick, H. Wehrheim, {ACM} Trans. Comput. Log. (2014) 31:1--31:37.","apa":"Schellhorn, G., Derrick, J., &#38; Wehrheim, H. (2014). A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures. <i>{ACM} Trans. Comput. Log.</i>, (4), 31:1--31:37. <a href=\"https://doi.org/10.1145/2629496\">https://doi.org/10.1145/2629496</a>"},"user_id":"29719","date_created":"2018-06-13T07:57:31Z"}