{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:06Z","timestamp":1750220166868,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T00:00:00Z","timestamp":1665014400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,6]]},"DOI":"10.1145\/3561320.3561325","type":"proceedings-article","created":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T22:11:32Z","timestamp":1664230292000},"page":"15-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploring Opacity Software Transactional Memory in Haskell through Graph Transformation"],"prefix":"10.1145","author":[{"given":"Diogo J.","family":"Cardoso","sequence":"first","affiliation":[{"name":"CDTec, Universidade Federal de Pelotas, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luciana","family":"Foss","sequence":"additional","affiliation":[{"name":"CDTec, Universidade Federal de Pelotas, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andre R.","family":"Du Bois","sequence":"additional","affiliation":[{"name":"CDTec, Universidade Federal de Pelotas, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,10,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Defining liveness. Information processing letters 21, 4","author":"Alpern Bowen","year":"1985","unstructured":"Bowen Alpern and Fred\u00a0 B Schneider . 1985. Defining liveness. Information processing letters 21, 4 ( 1985 ), 181\u2013185. Bowen Alpern and Fred\u00a0B Schneider. 1985. Defining liveness. Information processing letters 21, 4 (1985), 181\u2013185."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2833312.2833445"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/EMPDP.2019.8671637"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.04.028"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"M. Bardohl R.and\u00a0Minas G. Taentzer and A. Schurr. 1999. Application of graph transformation to visual languages. Handbook of graph grammars and computing by graph transformation 2 (1999) 105.  M. Bardohl R.and\u00a0Minas G. Taentzer and A. Schurr. 1999. Application of graph transformation to visual languages. Handbook of graph grammars and computing by graph transformation 2 (1999) 105.","DOI":"10.1142\/9789812815149_0003"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355378.3355387"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3475061.3475080"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Diogo\u00a0J. Cardoso Luciana Foss and Andr\u00e9\u00a0R. Du\u00a0Bois. 2021. A Methodology for Opacity verification for Transactional Memory algorithms using Graph Transformation System. In Anais do VI Workshop-Escola de Inform\u00e1tica Te\u00f3rica. SBC 9\u201316.  Diogo\u00a0J. Cardoso Luciana Foss and Andr\u00e9\u00a0R. Du\u00a0Bois. 2021. A Methodology for Opacity verification for Transactional Memory algorithms using Graph Transformation System. In Anais do VI Workshop-Escola de Inform\u00e1tica Te\u00f3rica. SBC 9\u201316.","DOI":"10.5753\/weit.2021.18916"},{"key":"e_1_3_2_1_10_1","volume-title":"Theorem proving graph grammars with attributes and negative application conditions. Theoretical computer science 686","author":"Costa Cavalheiro Simone Andr\u00e9","year":"2017","unstructured":"Simone Andr\u00e9 da\u00a0 Costa Cavalheiro , Luciana Foss , and Leila Ribeiro . 2017. Theorem proving graph grammars with attributes and negative application conditions. Theoretical computer science 686 ( 2017 ), 25\u201377. Simone Andr\u00e9 da\u00a0Costa Cavalheiro, Luciana Foss, and Leila Ribeiro. 2017. Theorem proving graph grammars with attributes and negative application conditions. Theoretical computer science 686 (2017), 25\u201377."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/5397.5399"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_14"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-019-00357-z"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2010.01.001"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Hartmut Ehrig Grzegorz Rozenberg and Hans-J rg Kreowski. 1999. Handbook of graph grammars and computing by graph transformation. Vol.\u00a03. world Scientific.  Hartmut Ehrig Grzegorz Rozenberg and Hans-J rg Kreowski. 1999. Handbook of graph grammars and computing by graph transformation. Vol.\u00a03. world Scientific.","DOI":"10.1142\/4181"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/4904.4999"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(83)90017-5"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Amir\u00a0Hossein Ghamarian Maarten de Mol Arend Rensink Eduardo Zambon and Maria Zimakova. 2012. Modelling and analysis using GROOVE. International journal on software tools for technology transfer 14 1(2012) 15\u201340.  Amir\u00a0Hossein Ghamarian Maarten de Mol Arend Rensink Eduardo Zambon and Maria Zimakova. 2012. Modelling and analysis using GROOVE. International journal on software tools for technology transfer 14 1(2012) 15\u201340.","DOI":"10.1007\/s10009-011-0186-x"},{"key":"e_1_3_2_1_19_1","volume-title":"Opacity: A correctness condition for transactional memory. Technical Report.","author":"Guerraoui Rachid","year":"2007","unstructured":"Rachid Guerraoui and Michal Kapalka . 2007 . Opacity: A correctness condition for transactional memory. Technical Report. Rachid Guerraoui and Michal Kapalka. 2007. Opacity: A correctness condition for transactional memory. Technical Report."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345233"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/3019225"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065952"},{"key":"e_1_3_2_1_23_1","volume-title":"Graph transformation in a nutshell. Electronic notes in theoretical computer science 148, 1","author":"Heckel Reiko","year":"2006","unstructured":"Reiko Heckel . 2006. Graph transformation in a nutshell. Electronic notes in theoretical computer science 148, 1 ( 2006 ), 187\u2013198. Reiko Heckel. 2006. Graph transformation in a nutshell. Electronic notes in theoretical computer science 148, 1 (2006), 187\u2013198."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.04.037"},{"key":"e_1_3_2_1_26_1","unstructured":"Priyanka Kumar and Sathya Peri. 2015. Multiversion Conflict Notion for Transactional Memory Systems. arXiv preprint arXiv:1509.04048(2015).  Priyanka Kumar and Sathya Peri. 2015. Multiversion Conflict Notion for Transactional Memory Systems. arXiv preprint arXiv:1509.04048(2015)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45249-9_14"},{"volume-title":"Exploring Progress Guarantees in Multi-Version Software Transactional Memory Systems. Ph.\u00a0D. Dissertation","author":"Kumari Sweta","key":"e_1_3_2_1_28_1","unstructured":"Sweta Kumari and Sathya Peri . 2019. Exploring Progress Guarantees in Multi-Version Software Transactional Memory Systems. Ph.\u00a0D. Dissertation . Indian Institute of Technology Hyderabad . Sweta Kumari and Sathya Peri. 2019. Exploring Progress Guarantees in Multi-Version Software Transactional Memory Systems. Ph.\u00a0D. Dissertation. Indian Institute of Technology Hyderabad."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.06.021"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3241625.2976020"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45174-8_27"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2541940.2541952"},{"volume-title":"Distributed algorithms","author":"Lynch A","key":"e_1_3_2_1_33_1","unstructured":"Nancy\u00a0 A Lynch . 1996. Distributed algorithms . Elsevier . Nancy\u00a0A Lynch. 1996. Distributed algorithms. Elsevier."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322158"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3148964"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/EURMIC.1997.617301"},{"key":"e_1_3_2_1_37_1","unstructured":"Arend Rensink Maarten De\u00a0Mol and Eduardo Zambon. 2022. GROOVE GRaphs for Object-Oriented VErification (Version 5.8.1). https:\/\/groove.cs.utwente.nl\/  Arend Rensink Maarten De\u00a0Mol and Eduardo Zambon. 2022. GROOVE GRaphs for Object-Oriented VErification (Version 5.8.1). https:\/\/groove.cs.utwente.nl\/"},{"key":"e_1_3_2_1_38_1","unstructured":"David Sabel. 2014. A Haskell-Implementation of STM Haskell with Early Conflict Detection.. In Software Engineering (Workshops). 171\u2013190.  David Sabel. 2014. A Haskell-Implementation of STM Haskell with Early Conflict Detection.. In Software Engineering (Workshops). 171\u2013190."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050028"},{"volume-title":"Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery","author":"Weikum Gerhard","key":"e_1_3_2_1_40_1","unstructured":"Gerhard Weikum and Gottfried Vossen . 2001. Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery . Elsevier . Gerhard Weikum and Gottfried Vossen. 2001. Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery. Elsevier."},{"volume-title":"Augmenting Transactional Memory with the Future Abstraction. Ph.\u00a0D. Dissertation","author":"Zeng Jingna","key":"e_1_3_2_1_41_1","unstructured":"Jingna Zeng . 2020. Augmenting Transactional Memory with the Future Abstraction. Ph.\u00a0D. Dissertation . KTH Royal Institute of Technology . Jingna Zeng. 2020. Augmenting Transactional Memory with the Future Abstraction. Ph.\u00a0D. Dissertation. KTH Royal Institute of Technology."}],"event":{"name":"SBLP 2022: XXVI Brazilian Symposium on Programming Languages","acronym":"SBLP 2022","location":"Virtual Event Brazil"},"container-title":["Proceedings of the XXVI Brazilian Symposium on Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561320.3561325","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3561320.3561325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:35Z","timestamp":1750186835000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561320.3561325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,6]]},"references-count":40,"alternative-id":["10.1145\/3561320.3561325","10.1145\/3561320"],"URL":"https:\/\/doi.org\/10.1145\/3561320.3561325","relation":{},"subject":[],"published":{"date-parts":[[2022,10,6]]},"assertion":[{"value":"2022-10-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}