{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:44:18Z","timestamp":1782927858543,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-23-CHR4-0009"],"award-info":[{"award-number":["ANR-23-CHR4-0009"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3796701.3815956","type":"proceedings-article","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:40:43Z","timestamp":1782924043000},"page":"456-466","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Conflict-Freedom as a Progress Condition"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1148-1228","authenticated-orcid":false,"given":"Petr","family":"Kuznetsov","sequence":"first","affiliation":[{"name":"T\u00e9l\u00e9com Paris, Institut Polytechnique Paris, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0573-2572","authenticated-orcid":false,"given":"Pierre","family":"Sutra","sequence":"additional","affiliation":[{"name":"T\u00e9l\u00e9com SudParis, Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6830-1649","authenticated-orcid":false,"given":"Guillermo","family":"Toyos-Marfurt","sequence":"additional","affiliation":[{"name":"T\u00e9l\u00e9com Paris, Institut Polytechnique de Paris, Palaiseau, France and T\u00e9l\u00e9com SudParis, Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90051-5"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the Twentieth ACM Symposium on Operating Systems Principles","author":"Abd-El-Malek Michael","unstructured":"Michael Abd-El-Malek, Gregory R. Ganger, Garth R. Goodson, Michael K. Reiter, and Jay J. Wylie. 2005. Fault-scalable Byzantine fault-tolerant services. In Proceedings of the Twentieth ACM Symposium on Operating Systems Principles (Brighton, United Kingdom) (SOSP '05). Association for Computing Machinery, New York, NY, USA, 59\u201374."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/153724.153741"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/74926.74970"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01782772"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/97444.97701"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2022.01.025"},{"key":"e_1_3_2_1_8_1","article-title":"The complexity of obstruction-free implementations","volume":"56","author":"Attiya Hagit","year":"2009","unstructured":"Hagit Attiya, Rachid Guerraoui, Danny Hendler, and Petr Kuznetsov. 2009. The complexity of obstruction-free implementations. J. ACM 56, 4(2009), 24:1\u201324:33.","journal-title":"J. ACM"},{"key":"e_1_3_2_1_9_1","volume-title":"Distributed computing: fundamentals, simulations, and advanced topics","author":"Attiya Hagit","unstructured":"Hagit Attiya and Jennifer Welch. 2004. Distributed computing: fundamentals, simulations, and advanced topics. Vol. 19. John Wiley & Sons, New York, NY, USA."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 7th Symposium on Operating Systems Design and Implementation","author":"Cowling James","year":"2006","unstructured":"James Cowling, Daniel Myers, Barbara Liskov, Rodrigo Rodrigues, and Liuba Shrira. 2006. HQ replication: a hybrid quorum protocol for byzantine fault tolerance. In Proceedings of the 7th Symposium on Operating Systems Design and Implementation (Seattle, Washington) (OSDI '06). USENIX Association, USA, 177\u2013190."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1060"},{"key":"e_1_3_2_1_12_1","volume-title":"Association for Computing Machinery","author":"David Tudor","unstructured":"Tudor David and Rachid Guerraoui. 2016. Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free. In SPAA, Christian Scheideler and Seth Gilbert (Eds.). Association for Computing Machinery, New York, NY, USA, 337\u2013348."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2020.24"},{"key":"e_1_3_2_1_15_1","volume-title":"Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony","author":"Gafni Eli","unstructured":"Eli Gafni. 1998. Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony. In PODC. Association for Computing Machinery, New York, NY, USA, 143\u2013152."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073863"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/850929.851942"},{"key":"e_1_3_2_1_19_1","volume-title":"The art of multiprocessor programming. Morgan Kaufmann","author":"Herlihy Maurice","unstructured":"Maurice Herlihy and Nir Shavit. 2008. The art of multiprocessor programming. Morgan Kaufmann, San Francisco, CA, USA."},{"key":"e_1_3_2_1_20_1","volume-title":"OPODIS (Lecture Notes in Computer Science","volume":"328","author":"Herlihy Maurice","year":"2011","unstructured":"Maurice Herlihy and Nir Shavit. 2011. On the Nature of Progress. In OPODIS (Lecture Notes in Computer Science, Vol. 7109), Antonio Fern\u00e1ndez Anta, Giuseppe Lipari, and Matthieu Roy (Eds.). Springer, Berlin, Heidelberg, 313\u2013328."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_22_1","volume-title":"29th International Conference on Principles of Distributed Systems (OPODIS 2025) (Leibniz International Proceedings in Informatics (LIPIcs)","author":"Kuznetsov Petr","unstructured":"Petr Kuznetsov and Nathan Josia Schrodt. 2026. Resolving Conflicts with Grace: Dynamically Concurrent Universality. In 29th International Conference on Principles of Distributed Systems (OPODIS 2025) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 361). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 33:1\u201333:29."},{"key":"e_1_3_2_1_23_1","unstructured":"Petr Kuznetsov Pierre Sutra and Guillermo Toyos-Marfurt. 2026. Conflict Freedom as a Progress Condition. arXiv:2605.19531 [cs.DC]"},{"key":"e_1_3_2_1_24_1","unstructured":"Petr Kuznetsov Pierre Sutra and Guillermo Toyos-Marfurt. 2026. Pending Conflicts Make Progress Impossible. arXiv:2602.04013 [cs.DC]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1977.229904"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_3_2_1_27_1","unstructured":"Leslie Lamport. 2005. Generalized consensus and Paxos. Microsoft Research technical report MSR-TR-2005-33."},{"key":"e_1_3_2_1_28_1","first-page":"163","article-title":"Memory requirements for agreement among unreliable asynchronous processes","volume":"4","author":"Loui M.C.","year":"1987","unstructured":"M.C. Loui and H.H. Abu-Amara. 1987. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research 4 (1987), 163\u2013183.","journal-title":"Advances in Computing Research"},{"key":"e_1_3_2_1_29_1","volume-title":"Distributed Algorithms. Morgan Kaufmann","author":"Lynch N.A.","unstructured":"N.A. Lynch. 1996. Distributed Algorithms. Morgan Kaufmann, San Francisco, CA, USA."},{"key":"e_1_3_2_1_30_1","volume-title":"Advances in Petri Nets","year":"1984","unstructured":"Antoni. Mazurkiewicz. 1985. Semantics of concurrent systems: A modular fixed-point trace approach. In Advances in Petri Nets 1984, G. Rozenberg (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 353\u2013375."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2517350"},{"key":"e_1_3_2_1_32_1","article-title":"The Space Complexity of Consensus from Swap","volume":"71","author":"Ovens Sean","year":"2024","unstructured":"Sean Ovens. 2024. The Space Complexity of Consensus from Swap. J. ACM 71, 1 (2024), 1:1\u20131:26.","journal-title":"J. ACM"},{"key":"e_1_3_2_1_33_1","volume-title":"Generic Broadcast","author":"Pedone Fernando","unstructured":"Fernando Pedone and Andr\u00e9 Schiper. 1999. Generic Broadcast. In Distributed Computing, Prasad Jayanti (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 94\u2013106."},{"key":"e_1_3_2_1_34_1","first-page":"1","article-title":"Making Democracy Work: Fixing and Simplifying Egalitarian Paxos. In OPODIS (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl","volume":"22","author":"Ryabinin Fedor","year":"2025","unstructured":"Fedor Ryabinin, Alexey Gotsman, and Pierre Sutra. 2025. Making Democracy Work: Fixing and Simplifying Egalitarian Paxos. In OPODIS (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 22:1\u201322:19.","journal-title":"Germany"},{"key":"e_1_3_2_1_35_1","volume-title":"Algorithms and Computation, Yingfei Dong, Ding-Zhu Du","author":"Schneider Johannes","unstructured":"Johannes Schneider and Roger Wattenhofer. 2009. Bounds on Contention Management Algorithms. In Algorithms and Computation, Yingfei Dong, Ding-Zhu Du, and Oscar Ibarra (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 441\u2013451."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477132.3483552"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5070\/SR31154817"},{"key":"e_1_3_2_1_38_1","article-title":"A Tight Space Bound for Consensus","volume":"50","author":"Zhu Leqi","year":"2021","unstructured":"Leqi Zhu. 2021. A Tight Space Bound for Consensus. SIAM J. Comput. 50, 3 (2021), STOC16-18-STOC16-29.","journal-title":"SIAM J. Comput."},{"key":"e_1_3_2_1_39_1","volume-title":"Optimistic Generic Broadcast","author":"Zieli\u0144ski Piotr","unstructured":"Piotr Zieli\u0144ski. 2005. Optimistic Generic Broadcast. In Distributed Computing, Pierre Fraigniaud (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 369\u2013383."}],"event":{"name":"PODC '26: ACM Symposium on Principles of Distributed Computing","location":"Egham United Kingdom","acronym":"PODC '26","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\/3796701.3815956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:48:11Z","timestamp":1782924491000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3796701.3815956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":39,"alternative-id":["10.1145\/3796701.3815956","10.1145\/3796701"],"URL":"https:\/\/doi.org\/10.1145\/3796701.3815956","relation":{},"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"2026-07-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}