{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:13Z","timestamp":1750220833064,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ISF","award":["380\/18"],"award-info":[{"award-number":["380\/18"]}]},{"name":"ESF","award":["MIS-5033021"],"award-info":[{"award-number":["MIS-5033021"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400257","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"503-505","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures"],"prefix":"10.1145","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[{"name":"Technion, Hifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ohad","family":"Ben-Baruch","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Be'er Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiota","family":"Fatourou","sequence":"additional","affiliation":[{"name":"FORTH ICS & University of Crete, Heraklion, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Hendler","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Be'er Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eleftherios","family":"Kosmas","sequence":"additional","affiliation":[{"name":"University of Crete, Heraklion, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Tracking in Order to Recover: Recoverable Lock-Free Data Structures. CoRR","author":"Attiya Hagit","year":"2019","unstructured":"Hagit Attiya , Ohad Ben-Baruch , Panagiota Fatourou , Danny Hendler , and Eleftherios Kosmas . 2019. Tracking in Order to Recover: Recoverable Lock-Free Data Structures. CoRR , Vol. abs\/ 1905 .13600 ( 2019 ). http:\/\/arxiv.org\/abs\/1905.13600 Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, and Eleftherios Kosmas. 2019. Tracking in Order to Recover: Recoverable Lock-Free Data Structures. CoRR, Vol. abs\/1905.13600 (2019). http:\/\/arxiv.org\/abs\/1905.13600"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212753"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/165231.165265"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323187"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752947"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950380"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835736"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2417887"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011776"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178490"},{"key":"e_1_3_2_1_11_1","volume-title":"15th International Conf (DISC). 300--314","author":"Harris Timothy L.","year":"2001","unstructured":"Timothy L. Harris . 2001 . A Pragmatic Implementation of Non-blocking Linked-Lists. In Distributed Computing , 15th International Conf (DISC). 300--314 . Timothy L. Harris. 2001. A Pragmatic Implementation of Non-blocking Linked-Lists. In Distributed Computing, 15th International Conf (DISC). 300--314."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.08.011"},{"volume-title":"30th International Symp on Distributed Computing DISC. 313--327","author":"Izraelevitz Joseph","key":"e_1_3_2_1_13_1","unstructured":"Joseph Izraelevitz , Hammurabi Mendes , and Michael L. Scott . 2016. Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model . In 30th International Symp on Distributed Computing DISC. 313--327 . Joseph Izraelevitz, Hammurabi Mendes, and Michael L. Scott. 2016. Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model. In 30th International Symp on Distributed Computing DISC. 313--327."},{"volume-title":"15th ACM Symp on Principles of Distributed Computing (PODC). 267--275","author":"Maged","key":"e_1_3_2_1_14_1","unstructured":"Maged M. Michael and Michael L. Scott. 1996. Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms . In 15th ACM Symp on Principles of Distributed Computing (PODC). 267--275 . Maged M. Michael and Michael L. Scott. 1996. Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. In 15th ACM Symp on Principles of Distributed Computing (PODC). 267--275."},{"volume-title":"Consistent and Durable Data Structures for Non-Volatile Byte-Addressable Memory. In 9th USENIX Conf on File and Storage Technologies. 61--75","author":"Venkataraman Shivaram","key":"e_1_3_2_1_15_1","unstructured":"Shivaram Venkataraman , Niraj Tolia , Parthasarathy Ranganathan , and Roy H. Campbell . 2011 . Consistent and Durable Data Structures for Non-Volatile Byte-Addressable Memory. In 9th USENIX Conf on File and Storage Technologies. 61--75 . Shivaram Venkataraman, Niraj Tolia, Parthasarathy Ranganathan, and Roy H. Campbell. 2011. Consistent and Durable Data Structures for Non-Volatile Byte-Addressable Memory. In 9th USENIX Conf on File and Storage Technologies. 61--75."}],"event":{"name":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '20"},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400257","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400257","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:35Z","timestamp":1750202015000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":15,"alternative-id":["10.1145\/3350755.3400257","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400257","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}