[{"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-030-50086-3\\_3","author":[{"last_name":"Bila","first_name":"Eleni","full_name":"Bila, Eleni"},{"first_name":"Simon","last_name":"Doherty","full_name":"Doherty, Simon"},{"full_name":"Dongol, Brijesh","last_name":"Dongol","first_name":"Brijesh"},{"full_name":"Derrick, John","last_name":"Derrick","first_name":"John"},{"last_name":"Schellhorn","first_name":"Gerhard","full_name":"Schellhorn, Gerhard"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"title":"Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory","year":"2020","intvolume":"     12136","date_updated":"2022-01-06T06:54:25Z","date_created":"2020-11-04T08:27:09Z","department":[{"_id":"77"}],"type":"conference","publication":"Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings","_id":"20274","publisher":"Springer","page":"39-58","editor":[{"full_name":"Gotsman, Alexey","first_name":"Alexey","last_name":"Gotsman"},{"last_name":"Sokolova","first_name":"Ana","full_name":"Sokolova, Ana"}],"volume":12136,"user_id":"29719","status":"public","citation":{"mla":"Bila, Eleni, et al. “Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory.” <i>Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</i>, edited by Alexey Gotsman and Ana Sokolova, vol. 12136, Springer, 2020, pp. 39–58, doi:<a href=\"https://doi.org/10.1007/978-3-030-50086-3\\_3\">10.1007/978-3-030-50086-3\\_3</a>.","bibtex":"@inproceedings{Bila_Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2020, series={Lecture Notes in Computer Science}, title={Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory}, volume={12136}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-50086-3\\_3\">10.1007/978-3-030-50086-3\\_3</a>}, booktitle={Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings}, publisher={Springer}, author={Bila, Eleni and Doherty, Simon and Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}, editor={Gotsman, Alexey and Sokolova, AnaEditors}, year={2020}, pages={39–58}, collection={Lecture Notes in Computer Science} }","ama":"Bila E, Doherty S, Dongol B, Derrick J, Schellhorn G, Wehrheim H. Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory. In: Gotsman A, Sokolova A, eds. <i>Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</i>. Vol 12136. Lecture Notes in Computer Science. Springer; 2020:39-58. doi:<a href=\"https://doi.org/10.1007/978-3-030-50086-3\\_3\">10.1007/978-3-030-50086-3\\_3</a>","ieee":"E. Bila, S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim, “Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory,” in <i>Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</i>, 2020, vol. 12136, pp. 39–58.","apa":"Bila, E., Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., &#38; Wehrheim, H. (2020). Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory. In A. Gotsman &#38; A. Sokolova (Eds.), <i>Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</i> (Vol. 12136, pp. 39–58). Springer. <a href=\"https://doi.org/10.1007/978-3-030-50086-3\\_3\">https://doi.org/10.1007/978-3-030-50086-3\\_3</a>","short":"E. Bila, S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, H. Wehrheim, in: A. Gotsman, A. Sokolova (Eds.), Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings, Springer, 2020, pp. 39–58.","chicago":"Bila, Eleni, Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike Wehrheim. “Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory.” In <i>Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</i>, edited by Alexey Gotsman and Ana Sokolova, 12136:39–58. Lecture Notes in Computer Science. Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-50086-3\\_3\">https://doi.org/10.1007/978-3-030-50086-3\\_3</a>."},"project":[{"name":"Validation of Software Transactional Memory","_id":"78"}]},{"project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"citation":{"mla":"Derrick, John, et al. “Verifying Correctness of Persistent Concurrent Data Structures.” <i>Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings</i>, 2019, pp. 179–95, doi:<a href=\"https://doi.org/10.1007/978-3-030-30942-8\\_12\">10.1007/978-3-030-30942-8\\_12</a>.","bibtex":"@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim_2019, title={Verifying Correctness of Persistent Concurrent Data Structures}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-30942-8\\_12\">10.1007/978-3-030-30942-8\\_12</a>}, booktitle={Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings}, author={Derrick, John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, year={2019}, pages={179–195} }","ama":"Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. Verifying Correctness of Persistent Concurrent Data Structures. In: <i>Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings</i>. ; 2019:179-195. doi:<a href=\"https://doi.org/10.1007/978-3-030-30942-8\\_12\">10.1007/978-3-030-30942-8\\_12</a>","ieee":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, and H. Wehrheim, “Verifying Correctness of Persistent Concurrent Data Structures,” in <i>Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings</i>, 2019, pp. 179–195.","apa":"Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., &#38; Wehrheim, H. (2019). Verifying Correctness of Persistent Concurrent Data Structures. In <i>Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings</i> (pp. 179–195). <a href=\"https://doi.org/10.1007/978-3-030-30942-8\\_12\">https://doi.org/10.1007/978-3-030-30942-8\\_12</a>","chicago":"Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim. “Verifying Correctness of Persistent Concurrent Data Structures.” In <i>Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings</i>, 179–95, 2019. <a href=\"https://doi.org/10.1007/978-3-030-30942-8\\_12\">https://doi.org/10.1007/978-3-030-30942-8\\_12</a>.","short":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, H. Wehrheim, in: Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings, 2019, pp. 179–195."},"publication":"Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings","department":[{"_id":"77"}],"type":"conference","date_created":"2019-10-24T08:20:28Z","date_updated":"2022-01-06T06:51:48Z","author":[{"full_name":"Derrick, John","last_name":"Derrick","first_name":"John"},{"last_name":"Doherty","first_name":"Simon","full_name":"Doherty, Simon"},{"full_name":"Dongol, Brijesh","first_name":"Brijesh","last_name":"Dongol"},{"first_name":"Gerhard","last_name":"Schellhorn","full_name":"Schellhorn, Gerhard"},{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"title":"Verifying Correctness of Persistent Concurrent Data Structures","status":"public","year":"2019","user_id":"29719","doi":"10.1007/978-3-030-30942-8\\_12","_id":"13993","language":[{"iso":"eng"}],"page":"179-195"},{"date_created":"2019-06-03T07:51:26Z","department":[{"_id":"77"}],"type":"conference","publication":"{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-030-20652-9\\_18","author":[{"full_name":"König, Jürgen","first_name":"Jürgen","last_name":"König","id":"22358"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike","id":"573"}],"title":"Data Independence for Software Transactional Memory","year":"2019","intvolume":"     11460","date_updated":"2022-01-06T06:50:28Z","citation":{"ieee":"J. König and H. Wehrheim, “Data Independence for Software Transactional Memory,” in <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i>, 2019, vol. 11460, pp. 263–279.","apa":"König, J., &#38; Wehrheim, H. (2019). Data Independence for Software Transactional Memory. In J. M. Badger &#38; K. Yvonne Rozier (Eds.), <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i> (Vol. 11460, pp. 263–279). Springer. <a href=\"https://doi.org/10.1007/978-3-030-20652-9\\_18\">https://doi.org/10.1007/978-3-030-20652-9\\_18</a>","short":"J. König, H. Wehrheim, in: J. M. Badger, K. Yvonne Rozier (Eds.), {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings, Springer, 2019, pp. 263–279.","chicago":"König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional Memory.” In <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i>, edited by Julia M. Badger and Kristin Yvonne Rozier, 11460:263–79. Lecture Notes in Computer Science. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-20652-9\\_18\">https://doi.org/10.1007/978-3-030-20652-9\\_18</a>.","mla":"König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional Memory.” <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i>, edited by Julia M. Badger and Kristin Yvonne Rozier, vol. 11460, Springer, 2019, pp. 263–79, doi:<a href=\"https://doi.org/10.1007/978-3-030-20652-9\\_18\">10.1007/978-3-030-20652-9\\_18</a>.","bibtex":"@inproceedings{König_Wehrheim_2019, series={Lecture Notes in Computer Science}, title={Data Independence for Software Transactional Memory}, volume={11460}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-20652-9\\_18\">10.1007/978-3-030-20652-9\\_18</a>}, booktitle={{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings}, publisher={Springer}, author={König, Jürgen and Wehrheim, Heike}, editor={M. Badger, Julia and Yvonne Rozier, KristinEditors}, year={2019}, pages={263–279}, collection={Lecture Notes in Computer Science} }","ama":"König J, Wehrheim H. Data Independence for Software Transactional Memory. In: M. Badger J, Yvonne Rozier K, eds. <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i>. Vol 11460. Lecture Notes in Computer Science. Springer; 2019:263-279. doi:<a href=\"https://doi.org/10.1007/978-3-030-20652-9\\_18\">10.1007/978-3-030-20652-9\\_18</a>"},"project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"_id":"10091","publisher":"Springer","page":"263-279","editor":[{"last_name":"M. Badger","first_name":"Julia","full_name":"M. Badger, Julia"},{"first_name":"Kristin","last_name":"Yvonne Rozier","full_name":"Yvonne Rozier, Kristin"}],"volume":11460,"user_id":"22358","status":"public"},{"project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"citation":{"ieee":"S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Verifying C11 programs operationally,” in <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i>, 2019, pp. 355–365.","apa":"Doherty, S., Dongol, B., Wehrheim, H., &#38; Derrick, J. (2019). Verifying C11 programs operationally. In J. K. Hollingsworth &#38; I. Keidar (Eds.), <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i> (pp. 355–365). {ACM}. <a href=\"https://doi.org/10.1145/3293883.3295702\">https://doi.org/10.1145/3293883.3295702</a>","mla":"Doherty, Simon, et al. “Verifying C11 Programs Operationally.” <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i>, edited by Jeffrey K. Hollingsworth and Idit Keidar, {ACM}, 2019, pp. 355–65, doi:<a href=\"https://doi.org/10.1145/3293883.3295702\">10.1145/3293883.3295702</a>.","bibtex":"@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2019, title={Verifying C11 programs operationally}, DOI={<a href=\"https://doi.org/10.1145/3293883.3295702\">10.1145/3293883.3295702</a>}, booktitle={Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019}, publisher={{ACM}}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, editor={K. Hollingsworth, Jeffrey and Keidar, IditEditors}, year={2019}, pages={355–365} }","ama":"Doherty S, Dongol B, Wehrheim H, Derrick J. Verifying C11 programs operationally. In: K. Hollingsworth J, Keidar I, eds. <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i>. {ACM}; 2019:355-365. doi:<a href=\"https://doi.org/10.1145/3293883.3295702\">10.1145/3293883.3295702</a>","short":"S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: J. K. Hollingsworth, I. Keidar (Eds.), Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019, {ACM}, 2019, pp. 355–365.","chicago":"Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Verifying C11 Programs Operationally.” In <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i>, edited by Jeffrey K. Hollingsworth and Idit Keidar, 355–65. {ACM}, 2019. <a href=\"https://doi.org/10.1145/3293883.3295702\">https://doi.org/10.1145/3293883.3295702</a>."},"publication":"Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019","department":[{"_id":"77"}],"type":"conference","date_created":"2019-06-03T07:59:36Z","date_updated":"2022-01-06T06:50:28Z","author":[{"first_name":"Simon","last_name":"Doherty","full_name":"Doherty, Simon"},{"full_name":"Dongol, Brijesh","first_name":"Brijesh","last_name":"Dongol"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"},{"last_name":"Derrick","first_name":"John","full_name":"Derrick, John"}],"title":"Verifying C11 programs operationally","status":"public","year":"2019","editor":[{"full_name":"K. Hollingsworth, Jeffrey","first_name":"Jeffrey","last_name":"K. Hollingsworth"},{"full_name":"Keidar, Idit","first_name":"Idit","last_name":"Keidar"}],"doi":"10.1145/3293883.3295702","user_id":"29719","language":[{"iso":"eng"}],"_id":"10092","publisher":"{ACM}","page":"355-365"},{"project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"citation":{"mla":"Schellhorn, Gerhard, et al. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.” <i>Software Engineering and Formal Methods</i>, Springer International Publishing, 2018, pp. 105–20, doi:<a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">10.1007/978-3-319-92970-5_7</a>.","bibtex":"@inbook{Schellhorn_Wedel_Travkin_König_Wehrheim_2018, place={Cham}, title={FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">10.1007/978-3-319-92970-5_7</a>}, booktitle={Software Engineering and Formal Methods}, publisher={Springer International Publishing}, author={Schellhorn, Gerhard and Wedel, Monika and Travkin, Oleg and König, Jürgen and Wehrheim, Heike}, year={2018}, pages={105–120} }","ama":"Schellhorn G, Wedel M, Travkin O, König J, Wehrheim H. FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In: <i>Software Engineering and Formal Methods</i>. Cham: Springer International Publishing; 2018:105-120. doi:<a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">10.1007/978-3-319-92970-5_7</a>","ieee":"G. Schellhorn, M. Wedel, O. Travkin, J. König, and H. Wehrheim, “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity,” in <i>Software Engineering and Formal Methods</i>, Cham: Springer International Publishing, 2018, pp. 105–120.","apa":"Schellhorn, G., Wedel, M., Travkin, O., König, J., &#38; Wehrheim, H. (2018). FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In <i>Software Engineering and Formal Methods</i> (pp. 105–120). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">https://doi.org/10.1007/978-3-319-92970-5_7</a>","short":"G. Schellhorn, M. Wedel, O. Travkin, J. König, H. Wehrheim, in: Software Engineering and Formal Methods, Springer International Publishing, Cham, 2018, pp. 105–120.","chicago":"Schellhorn, Gerhard, Monika Wedel, Oleg Travkin, Jürgen König, and Heike Wehrheim. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.” In <i>Software Engineering and Formal Methods</i>, 105–20. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">https://doi.org/10.1007/978-3-319-92970-5_7</a>."},"publication":"Software Engineering and Formal Methods","department":[{"_id":"77"}],"type":"book_chapter","place":"Cham","date_created":"2018-07-11T06:19:58Z","date_updated":"2022-01-06T06:59:22Z","publication_status":"published","author":[{"first_name":"Gerhard","last_name":"Schellhorn","full_name":"Schellhorn, Gerhard"},{"full_name":"Wedel, Monika","last_name":"Wedel","first_name":"Monika"},{"full_name":"Travkin, Oleg","last_name":"Travkin","first_name":"Oleg"},{"full_name":"König, Jürgen","last_name":"König","first_name":"Jürgen","id":"22358"},{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319929699","9783319929705"]},"status":"public","year":"2018","title":"FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity","doi":"10.1007/978-3-319-92970-5_7","user_id":"29719","_id":"3536","publisher":"Springer International Publishing","page":"105-120"},{"project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"publication":"Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings","citation":{"mla":"König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity Definitions for STMs.” <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>, edited by Dang Van Hung and Deepak Kapur, 2017, pp. 118--135, doi:<a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">10.1007/978-3-319-67729-3_8</a>.","bibtex":"@inproceedings{König_Wehrheim_2017, series={Lecture Notes in Computer Science}, title={Value-Based or Conflict-Based? Opacity Definitions for STMs}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">10.1007/978-3-319-67729-3_8</a>}, booktitle={Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings}, author={König, Jürgen and Wehrheim, Heike}, editor={Van Hung, Dang and Kapur, DeepakEditors}, year={2017}, pages={118--135}, collection={Lecture Notes in Computer Science} }","ama":"König J, Wehrheim H. Value-Based or Conflict-Based? Opacity Definitions for STMs. In: Van Hung D, Kapur D, eds. <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>. Lecture Notes in Computer Science. ; 2017:118--135. doi:<a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">10.1007/978-3-319-67729-3_8</a>","ieee":"J. König and H. Wehrheim, “Value-Based or Conflict-Based? Opacity Definitions for STMs,” in <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>, 2017, pp. 118--135.","apa":"König, J., &#38; Wehrheim, H. (2017). Value-Based or Conflict-Based? Opacity Definitions for STMs. In D. Van Hung &#38; D. Kapur (Eds.), <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i> (pp. 118--135). <a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">https://doi.org/10.1007/978-3-319-67729-3_8</a>","short":"J. König, H. Wehrheim, in: D. Van Hung, D. Kapur (Eds.), Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings, 2017, pp. 118--135.","chicago":"König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity Definitions for STMs.” In <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>, edited by Dang Van Hung and Deepak Kapur, 118--135. Lecture Notes in Computer Science, 2017. <a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">https://doi.org/10.1007/978-3-319-67729-3_8</a>."},"type":"conference","department":[{"_id":"77"}],"date_created":"2018-06-13T07:37:18Z","date_updated":"2022-01-06T06:59:00Z","status":"public","title":"Value-Based or Conflict-Based? Opacity Definitions for STMs","year":"2017","author":[{"full_name":"König, Jürgen","last_name":"König","first_name":"Jürgen"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"user_id":"29719","doi":"10.1007/978-3-319-67729-3_8","editor":[{"full_name":"Van Hung, Dang","first_name":"Dang","last_name":"Van Hung"},{"last_name":"Kapur","first_name":"Deepak","full_name":"Kapur, Deepak"}],"page":"118--135","_id":"3156","series_title":"Lecture Notes in Computer Science"},{"page":"35:1--35:17","series_title":"LIPIcs","_id":"3160","doi":"10.4230/LIPIcs.OPODIS.2016.35","user_id":"29719","editor":[{"full_name":"Fatourou, Panagiota","first_name":"Panagiota","last_name":"Fatourou"},{"last_name":"Jim{\\'{e}}nez","first_name":"Ernesto","full_name":"Jim{\\'{e}}nez, Ernesto"},{"last_name":"Pedone","first_name":"Fernando","full_name":"Pedone, Fernando"}],"title":"Proving Opacity of a Pessimistic {STM}","status":"public","year":"2016","author":[{"first_name":"Simon","last_name":"Doherty","full_name":"Doherty, Simon"},{"full_name":"Dongol, Brijesh","last_name":"Dongol","first_name":"Brijesh"},{"full_name":"Derrick, John","last_name":"Derrick","first_name":"John"},{"first_name":"Gerhard","last_name":"Schellhorn","full_name":"Schellhorn, Gerhard"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2022-01-06T06:59:01Z","date_created":"2018-06-13T07:44:15Z","type":"conference","department":[{"_id":"77"}],"publication":"20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain","citation":{"mla":"Doherty, Simon, et al. “Proving Opacity of a Pessimistic {STM}.” <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>, edited by Panagiota Fatourou et al., 2016, pp. 35:1--35:17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">10.4230/LIPIcs.OPODIS.2016.35</a>.","ama":"Doherty S, Dongol B, Derrick J, Schellhorn G, Wehrheim H. Proving Opacity of a Pessimistic {STM}. In: Fatourou P, Jim{\\’{e}}nez E, Pedone F, eds. <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>. LIPIcs. ; 2016:35:1--35:17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">10.4230/LIPIcs.OPODIS.2016.35</a>","bibtex":"@inproceedings{Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2016, series={LIPIcs}, title={Proving Opacity of a Pessimistic {STM}}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">10.4230/LIPIcs.OPODIS.2016.35</a>}, booktitle={20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain}, author={Doherty, Simon and Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}, editor={Fatourou, Panagiota and Jim{\\’{e}}nez, Ernesto and Pedone, FernandoEditors}, year={2016}, pages={35:1--35:17}, collection={LIPIcs} }","apa":"Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., &#38; Wehrheim, H. (2016). Proving Opacity of a Pessimistic {STM}. In P. Fatourou, E. Jim{\\’{e}}nez, &#38; F. Pedone (Eds.), <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i> (pp. 35:1--35:17). <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">https://doi.org/10.4230/LIPIcs.OPODIS.2016.35</a>","ieee":"S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim, “Proving Opacity of a Pessimistic {STM},” in <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>, 2016, pp. 35:1--35:17.","chicago":"Doherty, Simon, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike Wehrheim. “Proving Opacity of a Pessimistic {STM}.” In <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>, edited by Panagiota Fatourou, Ernesto Jim{\\’{e}}nez, and Fernando Pedone, 35:1--35:17. LIPIcs, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">https://doi.org/10.4230/LIPIcs.OPODIS.2016.35</a>.","short":"S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, H. Wehrheim, in: P. Fatourou, E. Jim{\\’{e}}nez, F. Pedone (Eds.), 20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain, 2016, pp. 35:1--35:17."},"project":[{"name":"Validation of Software Transactional Memory","_id":"78"}]},{"publication":"{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings","citation":{"apa":"Derrick, J., Dongol, B., Schellhorn, G., Travkin, O., &#38; Wehrheim, H. (2015). Verifying Opacity of a Transactional Mutex Lock. In N. Bj{\\o}rner &#38; F. S. de Boer (Eds.), <i>{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings</i> (pp. 161--177). <a href=\"https://doi.org/10.1007/978-3-319-19249-9_11\">https://doi.org/10.1007/978-3-319-19249-9_11</a>","ieee":"J. Derrick, B. Dongol, G. Schellhorn, O. Travkin, and H. Wehrheim, “Verifying Opacity of a Transactional Mutex Lock,” in <i>{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings</i>, 2015, pp. 161--177.","short":"J. Derrick, B. Dongol, G. Schellhorn, O. Travkin, H. Wehrheim, in: N. Bj{\\o}rner, F. S. de Boer (Eds.), {FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings, 2015, pp. 161--177.","chicago":"Derrick, John, Brijesh Dongol, Gerhard Schellhorn, Oleg Travkin, and Heike Wehrheim. “Verifying Opacity of a Transactional Mutex Lock.” In <i>{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings</i>, edited by Nikolaj Bj{\\o}rner and Frank S. de Boer, 161--177. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-19249-9_11\">https://doi.org/10.1007/978-3-319-19249-9_11</a>.","mla":"Derrick, John, et al. “Verifying Opacity of a Transactional Mutex Lock.” <i>{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings</i>, edited by Nikolaj Bj{\\o}rner and Frank S. de Boer, 2015, pp. 161--177, doi:<a href=\"https://doi.org/10.1007/978-3-319-19249-9_11\">10.1007/978-3-319-19249-9_11</a>.","ama":"Derrick J, Dongol B, Schellhorn G, Travkin O, Wehrheim H. Verifying Opacity of a Transactional Mutex Lock. In: Bj{\\o}rner N, S. de Boer F, eds. <i>{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings</i>. Lecture Notes in Computer Science. ; 2015:161--177. doi:<a href=\"https://doi.org/10.1007/978-3-319-19249-9_11\">10.1007/978-3-319-19249-9_11</a>","bibtex":"@inproceedings{Derrick_Dongol_Schellhorn_Travkin_Wehrheim_2015, series={Lecture Notes in Computer Science}, title={Verifying Opacity of a Transactional Mutex Lock}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-19249-9_11\">10.1007/978-3-319-19249-9_11</a>}, booktitle={{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings}, author={Derrick, John and Dongol, Brijesh and Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}, editor={Bj{\\o}rner, Nikolaj and S. de Boer, FrankEditors}, year={2015}, pages={161--177}, collection={Lecture Notes in Computer Science} }"},"project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"date_created":"2018-06-13T07:50:43Z","type":"conference","department":[{"_id":"77"}],"year":"2015","status":"public","title":"Verifying Opacity of a Transactional Mutex Lock","author":[{"last_name":"Derrick","first_name":"John","full_name":"Derrick, John"},{"full_name":"Dongol, Brijesh","last_name":"Dongol","first_name":"Brijesh"},{"last_name":"Schellhorn","first_name":"Gerhard","full_name":"Schellhorn, Gerhard"},{"last_name":"Travkin","first_name":"Oleg","full_name":"Travkin, Oleg"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"date_updated":"2022-01-06T06:59:01Z","page":"161--177","series_title":"Lecture Notes in Computer Science","_id":"3164","doi":"10.1007/978-3-319-19249-9_11","user_id":"29719","editor":[{"full_name":"Bj{\\o}rner, Nikolaj","first_name":"Nikolaj","last_name":"Bj{\\o}rner"},{"last_name":"S. de Boer","first_name":"Frank","full_name":"S. de Boer, Frank"}]}]