Bila, Eleni, et al. “Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory.”10.1007/978-3-030-50086-3‑3__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, edited by Alexey Gotsman and Ana Sokolova, vol. 12136, Springer, 2020, pp. 39–58, doi:10.1007/978-3-030-50086-3‑3.
LibreCat: /record/20274
DOI: 10.1007/978-3-030-50086-3‑3

Derrick, John, et al. “Verifying Correctness of Persistent Concurrent Data Structures.”10.1007/978-3-030-30942-8‑12__Formal Methods - The Next 30 Years - Third World Congress, FM 2019, Porto, Portugal, October 7-11, 2019, Proceedings, 2019, pp. 179–95, doi:10.1007/978-3-030-30942-8‑12.
LibreCat: /record/13993
DOI: 10.1007/978-3-030-30942-8‑12

König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional Memory.”10.1007/978-3-030-20652-9‑18__NASA Formal Methods - 11th International Symposium, NFM 2019, Houston, TX, USA, May 7-9, 2019, Proceedings, edited by Julia M. Badger and Kristin Yvonne Rozier, vol. 11460, Springer, 2019, pp. 263–79, doi:10.1007/978-3-030-20652-9‑18.
LibreCat: /record/10091
DOI: 10.1007/978-3-030-20652-9‑18

Doherty, Simon, et al. “Verifying10.1145/3293883.3295702__Programs Operationally.”10.1145/3293883.3295702__Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019, edited by Jeffrey K. Hollingsworth and Idit Keidar, ACM, 2019, pp. 355–65, doi:10.1145/3293883.3295702.
LibreCat: /record/10092
DOI: 10.1145/3293883.3295702

Schellhorn, Gerhard, et al. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.”10.1007/978-3-319-92970-5_7__Software Engineering and Formal Methods, Springer International Publishing, 2018, pp. 105–20, doi:10.1007/978-3-319-92970-5_7.
LibreCat: /record/3536
DOI: 10.1007/978-3-319-92970-5_7

König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity Definitions for STMs.”10.1007/978-3-319-67729-3_8__Theoretical Aspects of Computing - ICTAC 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings, edited by Dang Van Hung and Deepak Kapur, 2017, pp. 118--135, doi:10.1007/978-3-319-67729-3_8.
LibreCat: /record/3156
DOI: 10.1007/978-3-319-67729-3_8

Doherty, Simon, et al. “Proving Opacity of a Pessimistic STM.”10.4230/LIPIcs.OPODIS.2016.35__20th International Conference on Principles of Distributed Systems, OPODIS 2016, December 13-16, 2016, Madrid, Spain, edited by Panagiota Fatourou et al., 2016, pp. 35:1--35:17, doi:10.4230/LIPIcs.OPODIS.2016.35.
LibreCat: /record/3160
DOI: 10.4230/LIPIcs.OPODIS.2016.35

Derrick, John, et al. “Verifying Opacity of a Transactional Mutex Lock.”10.1007/978-3-319-19249-9_11__FM 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings, edited by Nikolaj Bjrner and Frank S. de Boer, 2015, pp. 161--177, doi:10.1007/978-3-319-19249-9_11.
LibreCat: /record/3164
DOI: 10.1007/978-3-319-19249-9_11