{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T04:06:25Z","timestamp":1749873985557,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","funder":[{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ontario Ministry of Colleges, Universities, Research Excellence and Security"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733517","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"252-255","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Using Detectability to Simplify the Design of Concurrent Algorithms for Persistent Memory"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3700-2301","authenticated-orcid":false,"given":"Ahmed","family":"Fahmy","sequence":"first","affiliation":[{"name":"Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8891-256X","authenticated-orcid":false,"given":"Wojciech","family":"Golab","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8734-1400","authenticated-orcid":false,"given":"Neeraj","family":"Mittal","sequence":"additional","affiliation":[{"name":"Computer Science, The University of Texas at Dallas, Dallas, Texas, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323187"},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. of the 28th International Conference on Principles of Distributed Systems (OPODIS)","volume":"324","author":"Dhoked Sahil","year":"2024","unstructured":"Sahil Dhoked, Ahmed Fahmy, Wojciech Golab, and Neeraj Mittal. 2024. RMR-Efficient Detectable Objects for Persistent Memory and Their Applications. In Proc. of the 28th International Conference on Principles of Distributed Systems (OPODIS), Vol. 324. 5:1\u20135:26."},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. of the 37th International Symposium on Distributed Computing (DISC). 17:1\u201317:24","author":"Dhoked Sahil","year":"2023","unstructured":"Sahil Dhoked, Wojciech Golab, and Neeraj Mittal. 2023. Modular Recoverable Mutual Exclusion Under System-Wide Failures. In Proc. of the 37th International Symposium on Distributed Computing (DISC). 17:1\u201317:24."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178490"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-019-00364-0"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.05.030"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. of the 30th International Symposium on Distributed Computing (DISC). 313\u2013327","author":"Izraelevitz Joseph","unstructured":"Joseph Izraelevitz, Hammurabi Mendes, and Michael L. Scott. 2016. Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model. In Proc. of the 30th International Symposium on Distributed Computing (DISC). 313\u2013327."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331634"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. of the 35th International Symposium on Distributed Computing (DISC). 30:1\u201330:16","author":"Maor Liat","year":"2021","unstructured":"Liat Maor and Gadi Taubenfeld. 2021. Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions. In Proc. of the 35th International Symposium on Distributed Computing (DISC). 30:1\u201330:16."},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. of the 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 106\u2013113","author":"John","unstructured":"John M. Mellor-Crummey and Michael L. Scott. 1991. Scalable reader-writer synchronization for shared-memory multiprocessors. In Proc. of the 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 106\u2013113."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3524053.3542749"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45071-8_25"}],"event":{"name":"PODC '25: ACM Symposium on Principles of Distributed Computing","location":"Hotel Las Brisas Huatulco Huatulco Mexico","acronym":"PODC '25","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:24:38Z","timestamp":1749824678000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":12,"alternative-id":["10.1145\/3732772.3733517","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733517","relation":{},"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}