{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:51Z","timestamp":1750220571056,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,9,27]]},"DOI":"10.1145\/3475061.3475080","type":"proceedings-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T19:46:12Z","timestamp":1633463172000},"page":"49-57","source":"Crossref","is-referenced-by-count":1,"title":["A Graph Transformation System formalism for correctness of Transactional Memory algorithms"],"prefix":"10.1145","author":[{"given":"Diogo","family":"Cardoso","sequence":"first","affiliation":[{"name":"CDTec - UFPel, Brazil"}]},{"given":"Luciana","family":"Foss","sequence":"additional","affiliation":[{"name":"CDTec - UFPel, Brazil"}]},{"given":"Andre","family":"Du Bois","sequence":"additional","affiliation":[{"name":"CDTec - UFPel, Brazil"}]}],"member":"320","published-online":{"date-parts":[[2021,10,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2833312.2833445"},{"key":"e_1_3_2_1_2_1","unstructured":"Anonymous. 0000. Details ommitted for double-blind reviewing.  Anonymous. 0000. Details ommitted for double-blind reviewing."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.04.028"},{"key":"e_1_3_2_1_4_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_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/LES.2010.2099104"},{"key":"e_1_3_2_1_6_1","first-page":"2","article-title":"The PCL Theorem","volume":"66","author":"Bushkov Victor","year":"2018","journal-title":"Journal of the ACM (JACM)"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2006.05.009"},{"volume-title":"Theorem proving graph grammars with attributes and negative application conditions. Theoretical computer science 686","year":"2017","author":"Costa Cavalheiro Simone Andr\u00e9","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-31277-0_20"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/5397.5399"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3068914"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Peter Damron Alexandra Fedorova Yossi Lev Victor Luchangco Mark Moir and Daniel Nussbaum. 2006. Hybrid transactional memory. In ACM Sigplan Notices Vol.\u00a041. ACM 336\u2013346.  Peter Damron Alexandra Fedorova Yossi Lev Victor Luchangco Mark Moir and Daniel Nussbaum. 2006. Hybrid transactional memory. In ACM Sigplan Notices Vol.\u00a041. ACM 336\u2013346.","DOI":"10.1145\/1168918.1168900"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_14"},{"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":"publisher","DOI":"10.1007\/s00165-012-0225-8"},{"volume-title":"Stretching transactional memory. ACM sigplan notices 44, 6","year":"2009","author":"Dragojevi\u0107 Aleksandar","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14720-8_1"},{"key":"e_1_3_2_1_18_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\/4180"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/4904.4999"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(83)90017-5"},{"volume-title":"Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming. 237\u2013246","year":"2008","author":"Felber Pascal","key":"e_1_3_2_1_21_1"},{"key":"e_1_3_2_1_22_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_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345233"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/3019225"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065952"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2003.1203503"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872048"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Maurice Herlihy and J\u00a0Eliot\u00a0B Moss. 1993. Transactional memory: Architectural support for lock-free data structures. Vol.\u00a021. ACM.  Maurice Herlihy and J\u00a0Eliot\u00a0B Moss. 1993. Transactional memory: Architectural support for lock-free data structures. Vol.\u00a021. ACM.","DOI":"10.1145\/173682.165164"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.05.023"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.04.037"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3200691.3178505"},{"key":"e_1_3_2_1_32_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_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45249-9_14"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.06.021"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45174-8_27"},{"key":"e_1_3_2_1_36_1","unstructured":"Virendra Marathe Michael Spear Christopher Heriot Athul Acharya David Eisenstat William Scherer and Michael Scott. 2006. Lowering the overhead of nonblocking software transactional memory. (2006).  Virendra Marathe Michael Spear Christopher Heriot Athul Acharya David Eisenstat William Scherer and Michael Scott. 2006. Lowering the overhead of nonblocking software transactional memory. (2006)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Alexander Matveev and Nir Shavit. 2015. Reduced hardware norec: A safe and scalable hybrid TM. In ACM SIGARCH Computer Architecture News Vol.\u00a043. 59\u201371.  Alexander Matveev and Nir Shavit. 2015. Reduced hardware norec: A safe and scalable hybrid TM. In ACM SIGARCH Computer Architecture News Vol.\u00a043. 59\u201371.","DOI":"10.1145\/2786763.2694393"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989500"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767438"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3148964"},{"key":"e_1_3_2_1_42_1","unstructured":"Arend Rensink Maarten De\u00a0Mol and Eduardo Zambon. 2021. GROOVE GRaphs for Object-Oriented VErification (Version 5.7.4). https:\/\/groove.cs.utwente.nl\/  Arend Rensink Maarten De\u00a0Mol and Eduardo Zambon. 2021. GROOVE GRaphs for Object-Oriented VErification (Version 5.7.4). https:\/\/groove.cs.utwente.nl\/"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_20"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050028"},{"volume-title":"Proc. WTTM 14(2014)","year":"2014","author":"Siek Konrad","key":"e_1_3_2_1_45_1"},{"volume-title":"Symp. on Self-Stabilizing Systems. 388\u2013404","year":"2010","author":"Wamhoff Jons-Tobias","key":"e_1_3_2_1_46_1"}],"event":{"name":"SBLP'21: 25th Brazilian Symposium on Programming Languages","acronym":"SBLP'21","location":"Joinville Brazil"},"container-title":["25th Brazilian Symposium on Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3475061.3475080","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3475061.3475080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:45Z","timestamp":1750195725000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3475061.3475080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,27]]},"references-count":45,"alternative-id":["10.1145\/3475061.3475080","10.1145\/3475061"],"URL":"https:\/\/doi.org\/10.1145\/3475061.3475080","relation":{},"subject":[],"published":{"date-parts":[[2021,9,27]]}}}