{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:55Z","timestamp":1750220335956,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["380\/18"],"award-info":[{"award-number":["380\/18"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1816922"],"award-info":[{"award-number":["1816922"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538446","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"209-219","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations"],"prefix":"10.1145","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[{"name":"Technion, HAIFA, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Constantin","family":"Enea","sequence":"additional","affiliation":[{"name":"LIX, Ecole Polytechnique, CNRS and Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer","family":"Welch","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/153724.153741"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0081-5"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200869"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.06.004"},{"key":"e_1_3_2_2_5_1","volume-title":"33rd International Symposium on Distributed Computing (DISC). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 2:1--2:17","author":"Attiya Hagit","year":"2019","unstructured":"Hagit Attiya and Constantin Enea . 2019 . Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects . In 33rd International Symposium on Distributed Computing (DISC). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 2:1--2:17 . Hagit Attiya and Constantin Enea. 2019. Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects. In 33rd International Symposium on Distributed Computing (DISC). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 2:1--2:17."},{"volume-title":"35th International Symposium on Distributed Computing (DISC). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 7:1--7:18","author":"Attiya Hagit","key":"e_1_3_2_2_6_1","unstructured":"Hagit Attiya , Constantin Enea , and Jennifer L. Welch . 2021 a. 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\u00fc r Informatik, 7:1--7:18 . Hagit Attiya, Constantin Enea, and Jennifer L. Welch. 2021 a. 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\u00fc r Informatik, 7:1--7:18."},{"key":"e_1_3_2_2_7_1","volume-title":"2021 b. Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs (version 1). CoRR","author":"Attiya Hagit","year":"2021","unstructured":"Hagit Attiya , Constantin Enea , and Jennifer L. Welch . 2021 b. Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs (version 1). CoRR , Vol. abs\/ 2106 .15554 ( 2021 ). https:\/\/arxiv.org\/abs\/2106.15554v1 Hagit Attiya, Constantin Enea, and Jennifer L. Welch. 2021 b. Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs (version 1). CoRR , Vol. abs\/2106.15554 (2021). https:\/\/arxiv.org\/abs\/2106.15554v1"},{"key":"e_1_3_2_2_8_1","volume-title":"Welch","author":"Attiya Hagit","year":"2022","unstructured":"Hagit Attiya , Constantin Enea , and Jennifer L . Welch . 2022 . Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations. CoRR , Vol. abs\/ 2106 .15554 (2022). https:\/\/arxiv.org\/abs\/2106.15554 Hagit Attiya, Constantin Enea, and Jennifer L. Welch. 2022. Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations. CoRR , Vol. abs\/2106.15554 (2022). https:\/\/arxiv.org\/abs\/2106.15554"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160158.2160159"},{"key":"e_1_3_2_2_10_1","volume-title":"An Impossibility Result on Strong Linearizability in Message-Passing Systems. CoRR","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 , Vol. abs\/ 2108 .01651 ( 2021 ). https:\/\/arxiv.org\/abs\/2108.01651 David Yu Cheng Chan, Vassos Hadzilacos, Xing Hu, and Sam Toueg. 2021. An Impossibility Result on Strong Linearizability in Message-Passing Systems. CoRR , Vol. abs\/2108.01651 (2021). https:\/\/arxiv.org\/abs\/2108.01651"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1891823.1891830"},{"volume-title":"Distributed Computing - 29th International Symposium (DISC)","author":"Denysyuk Oksana","key":"e_1_3_2_2_12_1","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. 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_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(83)90013-8"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993687"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_2_16_1","volume-title":"2020 a. On Atomic Registers and Randomized Consensus in M&M Systems (version 4). CoRR","author":"Hadzilacos Vassos","year":"2020","unstructured":"Vassos Hadzilacos , Xing Hu , and Sam Toueg . 2020 a. On Atomic Registers and Randomized Consensus in M&M Systems (version 4). CoRR , Vol. abs\/ 1906 .00298 ( 2020 ). http:\/\/arxiv.org\/abs\/1906.00298 Vassos Hadzilacos, Xing Hu, and Sam Toueg. 2020 a. On Atomic Registers and Randomized Consensus in M&M Systems (version 4). CoRR , Vol. abs\/1906.00298 (2020). http:\/\/arxiv.org\/abs\/1906.00298"},{"key":"e_1_3_2_2_17_1","volume-title":"2020 b. On Linearizability and the Termination of Randomized Algorithms. CoRR","author":"Hadzilacos Vassos","year":"2020","unstructured":"Vassos Hadzilacos , Xing Hu , and Sam Toueg . 2020 b. On Linearizability and the Termination of Randomized Algorithms. CoRR , Vol. abs\/ 2010 .15210 ( 2020 ). http:\/\/arxiv.org\/abs\/2010.15210 Vassos Hadzilacos, Xing Hu, and Sam Toueg. 2020 b. On Linearizability and the Termination of Randomized Algorithms. CoRR , Vol. abs\/2010.15210 (2020). http:\/\/arxiv.org\/abs\/2010.15210"},{"key":"e_1_3_2_2_18_1","volume-title":"On Register Linearizability and Termination. In ACM Symposium on Principles of Distributed Computing (PODC). ACM","author":"Hadzilacos Vassos","year":"2021","unstructured":"Vassos Hadzilacos , Xing Hu , and Sam Toueg . 2021 . On Register Linearizability and Termination. In ACM Symposium on Principles of Distributed Computing (PODC). ACM , New York, NY, USA, 521--531. Vassos Hadzilacos, Xing Hu, and Sam Toueg. 2021. On Register Linearizability and Termination. In ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, NY, USA, 521--531."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332508"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242708"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FTCS.1997.614100"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331632"},{"volume-title":"27th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 233--243","author":"Paul M.","key":"e_1_3_2_2_24_1","unstructured":"Paul M. B. Vit\u00e1 nyi and Baruch Awerbuch. 1986. Atomic Shared Register Access by Asynchronous Hardware . In 27th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 233--243 . Paul M. B. Vit\u00e1 nyi and Baruch Awerbuch. 1986. Atomic Shared Register Access by Asynchronous Hardware. In 27th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 233--243."}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Salerno Italy","acronym":"PODC '22"},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538446","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538446","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:21Z","timestamp":1750191141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":24,"alternative-id":["10.1145\/3519270.3538446","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538446","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}