{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:04:55Z","timestamp":1755839095664,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,2,17]],"date-time":"2021-02-17T00:00:00Z","timestamp":1613520000000},"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":[[2021,2,17]]},"DOI":"10.1145\/3437801.3441594","type":"proceedings-article","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T23:04:20Z","timestamp":1613862260000},"page":"16-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Investigating the semantics of futures in transactional memory systems"],"prefix":"10.1145","author":[{"given":"Jingna","family":"Zeng","sequence":"first","affiliation":[{"name":"University of Lisbon, Lisbon, Portugal"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shady","family":"Issa","sequence":"additional","affiliation":[{"name":"University of Lisbon, Lisbon, Portugal"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Romano","sequence":"additional","affiliation":[{"name":"University of Lisbon, Lisbon, Portugal"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Rodrigues","sequence":"additional","affiliation":[{"name":"University of Lisbon, Lisbon, Portugal"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seif","family":"Haridi","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,2,17]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345232"},{"key":"e_1_3_2_1_3_1","volume-title":"Abdelrahman","author":"Aydonat Utku","year":"2008","unstructured":"Utku Aydonat and Tarek S . Abdelrahman . 2008 . Serializability of Transactions in Software Transactional Memory . Utku Aydonat and Tarek S. Abdelrahman. 2008. Serializability of Transactions in Software Transactional Memory."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810528"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693466"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1966.264565"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2006.05.009"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2019.03.009"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2008.4636089"},{"key":"e_1_3_2_1_10_1","unstructured":"clojure.org. 2019. Concurrent Programming in Clojure. https:\/\/clojure.org\/about\/concurrent_programming.  clojure.org. 2019. Concurrent Programming in Clojure. https:\/\/clojure.org\/about\/concurrent_programming."},{"key":"e_1_3_2_1_11_1","volume-title":"Denning","author":"Coffman Edward G.","year":"1973","unstructured":"Edward G. Coffman and Peter J . Denning . 1973 . Operating Systems Theory. Prentice Hall Professional Technical Reference . Edward G. Coffman and Peter J. Denning. 1973. Operating Systems Theory. Prentice Hall Professional Technical Reference."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3177962"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442542"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41527-2_11"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2628071.2628080"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941579"},{"volume-title":"Transactional Memory. Foundations, Algorithms, Tools, and Applications","author":"Filipe Ricardo","key":"e_1_3_2_1_17_1","unstructured":"Ricardo Filipe and Joao Barreto . 2015. Nested Parallelism in Transactional Memory . In Transactional Memory. Foundations, Algorithms, Tools, and Applications . Springer , 192--209. Ricardo Filipe and Joao Barreto. 2015. Nested Parallelism in Transactional Memory. In Transactional Memory. Foundations, Algorithms, Tools, and Applications. Springer, 192--209."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2155620.2155655"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2541883.2541900"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626410000041"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_21"},{"key":"e_1_3_2_1_22_1","volume-title":"Opacity: A correctness condition for transactional memory. Technical Report. EPFL.","author":"Guerraoui Rachid","year":"2007","unstructured":"Rachid Guerraoui and Michal Kapalka . 2007 . Opacity: A correctness condition for transactional memory. Technical Report. EPFL. Rachid Guerraoui and Michal Kapalka. 2007. Opacity: A correctness condition for transactional memory. Technical Report. EPFL."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/4472.4478"},{"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.1145\/2611462.2611496"},{"key":"e_1_3_2_1_26_1","unstructured":"Yossi Lev Mark Moir and Dan Nussbaum. 2007. PhTM: Phased transactional memory.  Yossi Lev Mark Moir and Dan Nussbaum. 2007. PhTM: Phased transactional memory."},{"volume-title":"Javadoc of the Future Interface in JAVA","year":"2019","key":"e_1_3_2_1_27_1","unstructured":"Oracle. 2019. Javadoc of the Future Interface in JAVA ( 2019 ). https:\/\/docs.oracle.com\/javase\/8\/docs\/api\/java\/util\/concurrent\/Future.html. Oracle. 2019. Javadoc of the Future Interface in JAVA (2019). https:\/\/docs.oracle.com\/javase\/8\/docs\/api\/java\/util\/concurrent\/Future.html."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989500"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322158"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1521747.1521799"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281162"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.07.006"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693462"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693462"},{"key":"e_1_3_2_1_35_1","unstructured":"rust lang.org. 2019. Zero-cost Futures in Rust. https:\/\/docs.rs\/futures\/0.1.27\/futures\/.  rust lang.org. 2019. Zero-cost Futures in Rust. https:\/\/docs.rs\/futures\/0.1.27\/futures\/."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050028"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-015-0361-x"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14720-8_20"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3281366.3281373"},{"volume-title":"NePalTM: design and implementation of nested parallelism for transactional memory systems","author":"Volos Haris","key":"e_1_3_2_1_40_1","unstructured":"Haris Volos , Adam Welc , Ali-Reza Adl-Tabatabai , Tatiana Shpeisman , Xinmin Tian , and Ravi Narayanaswamy . 2009. NePalTM: design and implementation of nested parallelism for transactional memory systems . In ECOOP. Springer , 123--147. Haris Volos, Adam Welc, Ali-Reza Adl-Tabatabai, Tatiana Shpeisman, Xinmin Tian, and Ravi Narayanaswamy. 2009. NePalTM: design and implementation of nested parallelism for transactional memory systems. In ECOOP. Springer, 123--147."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094845"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503232"},{"key":"e_1_3_2_1_43_1","volume-title":"Spear","author":"Zardoshti Pantea","year":"2019","unstructured":"Pantea Zardoshti , Tingzhe Zhou , Pavithra Balaji , Michael L. Scott , and Michael F . Spear . 2019 . Simplifying Transactional Memory Support in C++. TACO 16, 3 (2019), 25:1--25:24. Pantea Zardoshti, Tingzhe Zhou, Pavithra Balaji, Michael L. Scott, and Michael F. Spear. 2019. Simplifying Transactional Memory Support in C++. TACO 16, 3 (2019), 25:1--25:24."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2016.57"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSIT.2010.5563895"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2017.17"}],"event":{"name":"PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"location":"Virtual Event Republic of Korea","acronym":"PPoPP '21"},"container-title":["Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437801.3441594","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437801.3441594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:25Z","timestamp":1750191445000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437801.3441594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,17]]},"references-count":45,"alternative-id":["10.1145\/3437801.3441594","10.1145\/3437801"],"URL":"https:\/\/doi.org\/10.1145\/3437801.3441594","relation":{},"subject":[],"published":{"date-parts":[[2021,2,17]]},"assertion":[{"value":"2021-02-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}