{"_id":"3182","year":"2012","citation":{"bibtex":"@inproceedings{Schellhorn_Wehrheim_Derrick_2012, series={Lecture Notes in Computer Science}, title={How to Prove Algorithms Linearisable}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-31424-7_21\">10.1007/978-3-642-31424-7_21</a>}, booktitle={Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings}, author={Schellhorn, Gerhard and Wehrheim, Heike and Derrick, John}, editor={Madhusudan, P. and A. Seshia, SanjitEditors}, year={2012}, pages={243--259}, collection={Lecture Notes in Computer Science} }","ama":"Schellhorn G, Wehrheim H, Derrick J. How to Prove Algorithms Linearisable. In: Madhusudan P, A. Seshia S, eds. <i>Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings</i>. Lecture Notes in Computer Science. ; 2012:243--259. doi:<a href=\"https://doi.org/10.1007/978-3-642-31424-7_21\">10.1007/978-3-642-31424-7_21</a>","apa":"Schellhorn, G., Wehrheim, H., &#38; Derrick, J. (2012). How to Prove Algorithms Linearisable. In P. Madhusudan &#38; S. A. Seshia (Eds.), <i>Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings</i> (pp. 243--259). <a href=\"https://doi.org/10.1007/978-3-642-31424-7_21\">https://doi.org/10.1007/978-3-642-31424-7_21</a>","chicago":"Schellhorn, Gerhard, Heike Wehrheim, and John Derrick. “How to Prove Algorithms Linearisable.” In <i>Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings</i>, edited by P. Madhusudan and Sanjit A. Seshia, 243--259. Lecture Notes in Computer Science, 2012. <a href=\"https://doi.org/10.1007/978-3-642-31424-7_21\">https://doi.org/10.1007/978-3-642-31424-7_21</a>.","mla":"Schellhorn, Gerhard, et al. “How to Prove Algorithms Linearisable.” <i>Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings</i>, edited by P. Madhusudan and Sanjit A. Seshia, 2012, pp. 243--259, doi:<a href=\"https://doi.org/10.1007/978-3-642-31424-7_21\">10.1007/978-3-642-31424-7_21</a>.","ieee":"G. Schellhorn, H. Wehrheim, and J. Derrick, “How to Prove Algorithms Linearisable,” in <i>Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings</i>, 2012, pp. 243--259.","short":"G. Schellhorn, H. Wehrheim, J. Derrick, in: P. Madhusudan, S. A. Seshia (Eds.), Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings, 2012, pp. 243--259."},"date_created":"2018-06-13T08:19:33Z","publication":"Computer Aided Verification - 24th International Conference, {CAV} 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings","page":"243--259","author":[{"first_name":"Gerhard","last_name":"Schellhorn","full_name":"Schellhorn, Gerhard"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"},{"full_name":"Derrick, John","last_name":"Derrick","first_name":"John"}],"status":"public","title":"How to Prove Algorithms Linearisable","date_updated":"2022-01-06T06:59:03Z","user_id":"29719","type":"conference","doi":"10.1007/978-3-642-31424-7_21","series_title":"Lecture Notes in Computer Science","editor":[{"last_name":"Madhusudan","first_name":"P.","full_name":"Madhusudan, P."},{"last_name":"A. Seshia","first_name":"Sanjit","full_name":"A. Seshia, Sanjit"}],"department":[{"_id":"77"}]}