{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:41Z","timestamp":1750220861164,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T00:00:00Z","timestamp":1569196800000},"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":[[2019,9,23]]},"DOI":"10.1145\/3355378.3355387","type":"proceedings-article","created":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T12:16:25Z","timestamp":1567685785000},"page":"3-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Graph Transformation System formalism for Software Transactional Memory Opacity"],"prefix":"10.1145","author":[{"given":"Diogo J.","family":"Cardoso","sequence":"first","affiliation":[{"name":"Programa de P\u00f3s-Gradua\u00e7\u00e3o em Computa\u00e7\u00e3o, Universidade Federal de Pelotas, Pelotas, RS, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luciana","family":"Foss","sequence":"additional","affiliation":[{"name":"Programa de P\u00f3s-Gradua\u00e7\u00e3o em Computa\u00e7\u00e3o, Universidade Federal de Pelotas, Pelotas, RS, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andre R. Du","family":"Bois","sequence":"additional","affiliation":[{"name":"Programa de P\u00f3s-Gradua\u00e7\u00e3o em Computa\u00e7\u00e3o, Universidade Federal de Pelotas, Pelotas, RS, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.04.028"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"M. Bardohl R.and Minas 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 Minas 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_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3266141"},{"key":"e_1_3_2_1_4_1","volume-title":"Theorem proving graph grammars with attributes and negative application conditions. Theoretical computer science 686","author":"da Costa Cavalheiro Simone Andr\u00e9","year":"2017","unstructured":"Simone Andr\u00e9 da Costa Cavalheiro , Luciana Foss , and Leila Ribeiro . 2017. Theorem proving graph grammars with attributes and negative application conditions. Theoretical computer science 686 ( 2017 ), 25--77. Simone Andr\u00e9 da Costa Cavalheiro, Luciana Foss, and Leila Ribeiro. 2017. Theorem proving graph grammars with attributes and negative application conditions. Theoretical computer science 686 (2017), 25--77."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3068914"},{"key":"e_1_3_2_1_6_1","volume-title":"TRANSACT'09: 4th Workshop on Transactional Computing.","author":"Dalessandro Luke","year":"2009","unstructured":"Luke Dalessandro and Michael L Scott . 2009 . Strong isolation is a weak idea . In TRANSACT'09: 4th Workshop on Transactional Computing. Luke Dalessandro and Michael L Scott. 2009. Strong isolation is a weak idea. In TRANSACT'09: 4th Workshop on Transactional Computing."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888781.1888788"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168918.1168900"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39176-7_11"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2010.01.001"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-012-0225-8"},{"volume-title":"Transactional Memory. Foundations, Algorithms, Tools, and Applications","author":"Dziuma Dmytro","key":"e_1_3_2_1_12_1","unstructured":"Dmytro Dziuma , Panagiota Fatourou , and Eleni Kanellou . 2015. Consistency for transactional memory computing . In Transactional Memory. Foundations, Algorithms, Tools, and Applications . Springer , 3--31. Dmytro Dziuma, Panagiota Fatourou, and Eleni Kanellou. 2015. Consistency for transactional memory computing. In Transactional Memory. Foundations, Algorithms, Tools, and Applications. Springer, 3--31."},{"volume-title":"Handbook of graph grammars and computing by graph transformation","author":"Ehrig Hartmut","key":"e_1_3_2_1_13_1","unstructured":"Hartmut Ehrig , Grzegorz Rozenberg , and Hans- J rg Kreowski . 1999. Handbook of graph grammars and computing by graph transformation . Vol. 3 . world Scientific . Hartmut Ehrig, Grzegorz Rozenberg, and Hans-J rg Kreowski. 1999. Handbook of graph grammars and computing by graph transformation. Vol. 3. world Scientific."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345233"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3019225"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065952"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/173682.165164"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.05.023"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.04.037"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178505"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45174-8_27"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786763.2694393"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989500"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767438"},{"key":"e_1_3_2_1_26_1","volume-title":"Maarten De Mol, and Eduardo Zambon","author":"Rensink Arend","year":"2019","unstructured":"Arend Rensink , Maarten De Mol, and Eduardo Zambon . 2019 . GROOVE GRaphs for Object-Oriented VErification (Version 5.7.4). https:\/\/groove.cs.utwente.nl\/ Arend Rensink, Maarten De Mol, and Eduardo Zambon. 2019. GROOVE GRaphs for Object-Oriented VErification (Version 5.7.4). https:\/\/groove.cs.utwente.nl\/"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050028"},{"key":"e_1_3_2_1_28_1","volume-title":"Proc. WTTM 14","author":"Siek Konrad","year":"2014","unstructured":"Konrad Siek and Pawe\u0142t T Wojciechowski . 2014 . Zen and the art of concurrency control: an exploration of TM safety property space with early release in mind . Proc. WTTM 14 (2014). Konrad Siek and Pawe\u0142t T Wojciechowski. 2014. Zen and the art of concurrency control: an exploration of TM safety property space with early release in mind. Proc. WTTM 14 (2014)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1926829.1926863"}],"event":{"name":"SBLP 2019: XXIII Brazilian Symposium on Programming Languages","sponsor":["SBC Sociedade Brasileira de Computa\u00e7\u00e3o"],"location":"Salvador Brazil","acronym":"SBLP 2019"},"container-title":["Proceedings of the XXIII Brazilian Symposium on Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3355378.3355387","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3355378.3355387","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:34Z","timestamp":1750202614000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3355378.3355387"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,23]]},"references-count":28,"alternative-id":["10.1145\/3355378.3355387","10.1145\/3355378"],"URL":"https:\/\/doi.org\/10.1145\/3355378.3355387","relation":{},"subject":[],"published":{"date-parts":[[2019,9,23]]},"assertion":[{"value":"2019-09-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}