{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:45:51Z","timestamp":1782971151413,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["22\/1425"],"award-info":[{"award-number":["22\/1425"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DGAPA PAPIIT","award":["IN108723"],"award-info":[{"award-number":["IN108723"]}]},{"name":"French ANR Agency","award":["SCEPROOF"],"award-info":[{"award-number":["SCEPROOF"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3662158.3662790","type":"proceedings-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T14:38:06Z","timestamp":1717598286000},"page":"432-442","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Strong Linearizability using Primitives with Consensus Number 2"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8017-6457","authenticated-orcid":false,"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8017-8639","authenticated-orcid":false,"given":"Armando","family":"Castaneda","sequence":"additional","affiliation":[{"name":"Universidad Nacional Aut\u00f3noma de M\u00e9xico (UNAM), Mexico City, Mexico"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2727-8865","authenticated-orcid":false,"given":"Constantin","family":"Enea","sequence":"additional","affiliation":[{"name":"LIX, Ecole Polytechnique, CNRS and Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/153724.153741"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0023-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993823"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0969"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/164051.164071"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582728"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"James Aspnes and Maurice Herlihy. 1990. Wait-free data structures in the asynchronous PRAM model. In SPAA. 340--349.","DOI":"10.1145\/97444.97701"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2402.13618"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.06.004"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2019.2"},{"key":"e_1_3_2_1_11_1","first-page":"1","article-title":"Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers. In 35th International Symposium on Distributed Computing (DISC)","volume":"7","author":"Attiya Hagit","year":"2021","unstructured":"Hagit Attiya, Constantin Enea, and Jennifer L. Welch. 2021. Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers. In 35th International Symposium on Distributed Computing (DISC). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 7:1--7:18.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00446-022-00440-Y"},{"key":"e_1_3_2_1_13_1","volume-title":"An Impossibility Result on Strong Linearizability in Message-Passing Systems. CoRR abs\/2108.01651","author":"Cheng Chan David Yu","year":"2021","unstructured":"David Yu Cheng Chan, Vassos Hadzilacos, Xing Hu, and Sam Toueg. 2021. An Impossibility Result on Strong Linearizability in Message-Passing Systems. CoRR abs\/2108.01651 (2021). https:\/\/arxiv.org\/abs\/2108.01651"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2009-0393"},{"key":"e_1_3_2_1_15_1","volume-title":"Distributed Computing - 29th International Symposium (DISC)","author":"Denysyuk Oksana","unstructured":"Oksana Denysyuk and Philipp Woelfel. 2015. Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability. In Distributed Computing - 29th International Symposium (DISC). Springer, 60--74."},{"key":"e_1_3_2_1_16_1","volume-title":"Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. In 33rd International Conference on Concurrency Theory (CONCUR","author":"Dongol Brijesh","year":"2022","unstructured":"Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim. 2022. Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. In 33rd International Conference on Concurrency Theory (CONCUR 2022)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993687"},{"key":"e_1_3_2_1_18_1","volume-title":"On Linearizability and the Termination of Randomized Algorithms. CoRR abs\/2010.15210","author":"Hadzilacos Vassos","year":"2020","unstructured":"Vassos Hadzilacos, Xing Hu, and Sam Toueg. 2020. On Linearizability and the Termination of Randomized Algorithms. CoRR abs\/2010.15210 (2020). http:\/\/arxiv.org\/abs\/2010.15210"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332508"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429109"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198119"},{"key":"e_1_3_2_1_23_1","unstructured":"Maurice Herlihy and Nir Shavit. 2008. The art of multiprocessor programming. Morgan Kaufmann."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_25_1","volume-title":"Strongly Linearizable Linked List and Queue. In 25th International Conference on Principles of Distributed Systems (OPODIS","author":"Hwang Steven Munsu","year":"2022","unstructured":"Steven Munsu Hwang and Philipp Woelfel. 2022. Strongly Linearizable Linked List and Queue. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021)."},{"key":"e_1_3_2_1_26_1","volume-title":"Non-blocking implementations of queues in asynchronous distributed shared-memory systems","author":"Zongpeng Li.","year":"1807","unstructured":"Zongpeng Li. 2001. Non-blocking implementations of queues in asynchronous distributed shared-memory systems. University of Toronto. https:\/\/hdl.handle.net\/1807\/16583"},{"key":"e_1_3_2_1_27_1","first-page":"1","article-title":"Recoverable and Detectable Fetch&Add. In 25th International Conference on Principles of Distributed Systems","volume":"29","author":"Nahum Liad","year":"2021","unstructured":"Liad Nahum, Hagit Attiya, Ohad Ben-Baruch, and Danny Hendler. 2021. Recoverable and Detectable Fetch&Add. In 25th International Conference on Principles of Distributed Systems, OPODIS. 29:1--29:17.","journal-title":"OPODIS."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Sean Ovens and Philipp Woelfel. 2019. Strongly Linearizable Implementations of Snapshots and Other Types. In PODC. 197--206.","DOI":"10.1145\/3293611.3331632"}],"event":{"name":"PODC '24: 43rd ACM Symposium on Principles of Distributed Computing","location":"Nantes France","acronym":"PODC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662790","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:41Z","timestamp":1750290221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":28,"alternative-id":["10.1145\/3662158.3662790","10.1145\/3662158"],"URL":"https:\/\/doi.org\/10.1145\/3662158.3662790","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}