{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:54:48Z","timestamp":1768348488815,"version":"3.49.0"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA","license":[{"start":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T00:00:00Z","timestamp":1605225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["610150"],"award-info":[{"award-number":["610150"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008952","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["12744-ANR-17-CE25-0008-01"],"award-info":[{"award-number":["12744-ANR-17-CE25-0008-01"]}],"id":[{"id":"10.13039\/501100008952","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["389792660-TRR 248"],"award-info":[{"award-number":["389792660-TRR 248"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2020,11,13]]},"abstract":"<jats:p>Synchronization primitives for fault-tolerant distributed systems that ensure an effective and efficient cooperation among processes are an important challenge in the programming languages community. We present a new programming abstraction, ReSync, for implementing benign and Byzantine fault-tolerant protocols. ReSync has a new round structure that offers a simple abstraction for group communication, like it is customary in synchronous systems, but also allows messages to be received one by one, like in the asynchronous systems. This extension allows implementing network and algorithm-specific policies for the message reception, which is not possible in classic round models.<\/jats:p><jats:p>The execution of ReSync programs is based on a new generic round switch protocol that generalizes the famous theoretical result about consensus in the presence of partial synchrony by of Dwork, Lynch, and Stockmeyer. We evaluate experimentally the performance of ReSync\u2019s execution platform, by comparing consensus implementations in ReSync with LibPaxos3, etcd, and Bft-SMaRt, three consensus libraries tolerant to benign, resp. byzantine faults.<\/jats:p>","DOI":"10.1145\/3428281","type":"journal-article","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T23:36:06Z","timestamp":1606260966000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Programming at the edge of synchrony"],"prefix":"10.1145","volume":"4","author":[{"given":"Cezara","family":"Dr\u0103goi","sequence":"first","affiliation":[{"name":"Inria, France \/ ENS, France \/ CNRS, France \/ PSL University, France \/ Informal Systems, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2795-611X","authenticated-orcid":false,"given":"Josef","family":"Widder","sequence":"additional","affiliation":[{"name":"Informal Systems, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3197-8736","authenticated-orcid":false,"given":"Damien","family":"Zufferey","sequence":"additional","affiliation":[{"name":"MPI-SWS, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,11,13]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"etcd. Retrieved","year":"2019","unstructured":"2019. etcd. Retrieved Nov 21, 2019 from https:\/\/etcd.io\/ 2019. etcd. Retrieved Nov 21, 2019 from https:\/\/etcd.io\/"},{"key":"e_1_2_1_2_1","first-page":"1","article-title":"Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction","author":"Aminof Benjamin","year":"2018","unstructured":"Benjamin Aminof , Sasha Rubin , Ilina Stoilkovska , Josef Widder , and Florian Zuleger . 2018 . Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction . In VMCAI. 1 - 24 . Benjamin Aminof, Sasha Rubin, Ilina Stoilkovska, Josef Widder, and Florian Zuleger. 2018. Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction. In VMCAI. 1-24.","journal-title":"VMCAI."},{"key":"e_1_2_1_3_1","volume-title":"Oded Naor, Dmitri Perelman, and Alberto Sonnino.","author":"Baudet Mathieu","year":"2019","unstructured":"Mathieu Baudet , Avery Ching , Andrey Chursin , George Danezis , Fran\u00e7ois Garillot , Dahlia Malkhi Zekun Li , Oded Naor, Dmitri Perelman, and Alberto Sonnino. 2019 . State Machine Replication in the Libra Blockchain . https:\/\/developers. libra.org\/docs\/assets\/papers\/libra-consensus-state-machine-replication-in-the-libra-blockchain.pdf. Mathieu Baudet, Avery Ching, Andrey Chursin, George Danezis, Fran\u00e7ois Garillot, Dahlia Malkhi Zekun Li, Oded Naor, Dmitri Perelman, and Alberto Sonnino. 2019. State Machine Replication in the Libra Blockchain. https:\/\/developers. libra.org\/docs\/assets\/papers\/libra-consensus-state-machine-replication-in-the-libra-blockchain.pdf."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2014.43"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/1281100.1281136","article-title":"Tolerating corrupted communication","author":"Biely Martin","year":"2007","unstructured":"Martin Biely , Bernadette Charron-Bost , Antoine Gaillard , Martin Hutle , Andr\u00e9 Schiper , and Josef Widder . 2007 . Tolerating corrupted communication . In PODC. 244 - 253 . Martin Biely, Bernadette Charron-Bost, Antoine Gaillard, Martin Hutle, Andr\u00e9 Schiper, and Josef Widder. 2007. Tolerating corrupted communication. In PODC. 244-253.","journal-title":"PODC."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/37499.37515"},{"key":"e_1_2_1_7_1","volume-title":"International Symposium on Distributed Computing ( 2020 )","author":"Bravo Manuel","year":"2020","unstructured":"Manuel Bravo , Gregory Chockler , and Alexey Gotsman . 2020 . Making Byzantine consensus live . International Symposium on Distributed Computing ( 2020 ) , to appear. Manuel Bravo, Gregory Chockler, and Alexey Gotsman. 2020. Making Byzantine consensus live. International Symposium on Distributed Computing ( 2020 ), to appear."},{"key":"e_1_2_1_8_1","volume-title":"Tendermint: Byzantine Fault Tolerance in the Age of Blockchains. Master's thesis","author":"Buchman Ethan","year":"2016","unstructured":"Ethan Buchman . 2016 . Tendermint: Byzantine Fault Tolerance in the Age of Blockchains. Master's thesis . University of Guelph. http :\/\/hdl.handle.net\/10214\/9769. Ethan Buchman. 2016. Tendermint: Byzantine Fault Tolerance in the Age of Blockchains. Master's thesis. University of Guelph. http:\/\/hdl.handle.net\/10214\/9769."},{"key":"e_1_2_1_9_1","volume-title":"The latest gossip on BFT consensus. CoRR abs\/","author":"Buchman Ethan","year":"1807","unstructured":"Ethan Buchman , Jae Kwon , and Zarko Milosevic . 2018. The latest gossip on BFT consensus. CoRR abs\/ 1807 .04938 ( 2018 ). http:\/\/arxiv.org\/abs\/ 1807.04938 Ethan Buchman, Jae Kwon, and Zarko Milosevic. 2018. The latest gossip on BFT consensus. CoRR abs\/ 1807.04938 ( 2018 ). http:\/\/arxiv.org\/abs\/ 1807.04938"},{"key":"e_1_2_1_10_1","volume-title":"Bug report. https:\/\/issues.apache.org\/jira\/browse\/CASSANDRA-6023. accessed","author":"CASSANDRA","year":"2020","unstructured":"CASSANDRA 2013. Bug report. https:\/\/issues.apache.org\/jira\/browse\/CASSANDRA-6023. accessed May 2020 . CASSANDRA 2013. Bug report. https:\/\/issues.apache.org\/jira\/browse\/CASSANDRA-6023. accessed May 2020."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"},{"key":"e_1_2_1_13_1","first-page":"93","article-title":"A Reduction Theorem for the Verification of Round-Based Distributed Algorithms","volume":"5797","author":"Chaouch-Saad Mouna","year":"2009","unstructured":"Mouna Chaouch-Saad , Bernadette Charron-Bost , and Stephan Merz . 2009 . A Reduction Theorem for the Verification of Round-Based Distributed Algorithms . In RP (LNCS) , Vol. 5797. 93 - 106 . Mouna Chaouch-Saad, Bernadette Charron-Bost, and Stephan Merz. 2009. A Reduction Theorem for the Verification of Round-Based Distributed Algorithms. In RP (LNCS), Vol. 5797. 93-106.","journal-title":"RP (LNCS)"},{"key":"e_1_2_1_14_1","first-page":"2","article-title":"Formal Verification of a Consensus Algorithm in the Heard-Of","volume":"3","author":"Charron-Bost Bernadette","year":"2009","unstructured":"Bernadette Charron-Bost and Stephan Merz . 2009 . Formal Verification of a Consensus Algorithm in the Heard-Of Model. Int. J. Software and Informatics 3 , 2 - 3 ( 2009 ), 273-303. Bernadette Charron-Bost and Stephan Merz. 2009. Formal Verification of a Consensus Algorithm in the Heard-Of Model. Int. J. Software and Informatics 3, 2-3 ( 2009 ), 273-303.","journal-title":"Model. Int. J. Software and Informatics"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Bernadette Charron-Bost and Andr\u00e9 Schiper. 2009. The Heard-Of model: computing in distributed systems with benign faults. Distributed Computing 22 1 ( 2009 ) 49-71. Bernadette Charron-Bost and Andr\u00e9 Schiper. 2009. The Heard-Of model: computing in distributed systems with benign faults. Distributed Computing 22 1 ( 2009 ) 49-71.","DOI":"10.1007\/s00446-009-0084-6"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2018.8548057"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Andrei Damian Cezara Dr\u0103goi Alexandru Militaru and Josef Widder. 2019. Communication-closed asynchronous protocols. In CAV. (to appear). Andrei Damian Cezara Dr\u0103goi Alexandru Militaru and Josef Widder. 2019. Communication-closed asynchronous protocols. In CAV. (to appear).","DOI":"10.1007\/978-3-030-25543-5_20"},{"key":"e_1_2_1_18_1","unstructured":"Henri Debrat and Stephan Merz. 2012. Verifying Fault-Tolerant Distributed Algorithms in the Heard-Of Model. Archive of Formal Proofs 2012 ( 2012 ). Henri Debrat and Stephan Merz. 2012. Verifying Fault-Tolerant Distributed Algorithms in the Heard-Of Model. Archive of Formal Proofs 2012 ( 2012 )."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462184"},{"key":"e_1_2_1_20_1","volume-title":"A Logic-Based Framework for Verifying Consensus Algorithms","author":"Dragoi Cezara","unstructured":"Cezara Dragoi , Thomas A. Henzinger , Helmut Veith , Josef Widder , and Damien Zuferey . 2014. A Logic-Based Framework for Verifying Consensus Algorithms . In VMCAI, Kenneth L. McMillan and Xavier Rival (Eds.). Springer , 161-181. Cezara Dragoi, Thomas A. Henzinger, Helmut Veith, Josef Widder, and Damien Zuferey. 2014. A Logic-Based Framework for Verifying Consensus Algorithms. In VMCAI, Kenneth L. McMillan and Xavier Rival (Eds.). Springer, 161-181."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837650"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2005.54"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Tzilla Elrad and Nissim Francez. 1982. Decomposition of Distributed Programs into Communication-Closed Layers. Sci. Comput. Program. 2 3 ( 1982 ) 155-173. Tzilla Elrad and Nissim Francez. 1982. Decomposition of Distributed Programs into Communication-Closed Layers. Sci. Comput. Program. 2 3 ( 1982 ) 155-173.","DOI":"10.1016\/0167-6423(83)90013-8"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.84874"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00590-9_19"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277724"},{"key":"e_1_2_1_29_1","first-page":"245","article-title":"Zab: High-performance broadcast for primary-backup systems","author":"Junqueira Flavio Paiva","year":"2011","unstructured":"Flavio Paiva Junqueira , Benjamin C. Reed , and Marco Serafini . 2011 . Zab: High-performance broadcast for primary-backup systems . In DSN. 245 - 256 . Flavio Paiva Junqueira, Benjamin C. Reed, and Marco Serafini. 2011. Zab: High-performance broadcast for primary-backup systems. In DSN. 245-256.","journal-title":"DSN."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658357.1658358"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_2_1_33_1","first-page":"717","volume-title":"Reduction: A Method of Proving Properties of Parallel Programs. Commun. ACM 18, 12 ( 1975 )","author":"Lipton Richard J.","year":"1975","unstructured":"Richard J. Lipton . 1975 . Reduction: A Method of Proving Properties of Parallel Programs. Commun. ACM 18, 12 ( 1975 ) , 717 - 721 . Richard J. Lipton. 1975. Reduction: A Method of Proving Properties of Parallel Programs. Commun. ACM 18, 12 ( 1975 ), 717-721."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384645"},{"key":"e_1_2_1_35_1","unstructured":"Nancy Lynch. 1996. Distributed Algorithms. Morgan Kaufman. Nancy Lynch. 1996. Distributed Algorithms. Morgan Kaufman."},{"key":"e_1_2_1_36_1","first-page":"217","article-title":"Cutof Bounds for Consensus Algorithms","author":"Mari\u0107 Ognjen","year":"2017","unstructured":"Ognjen Mari\u0107 , Christoph Sprenger , and David A. Basin . 2017 . Cutof Bounds for Consensus Algorithms . In CAV. 217 - 237 . Ognjen Mari\u0107, Christoph Sprenger, and David A. Basin. 2017. Cutof Bounds for Consensus Algorithms. In CAV. 217-237.","journal-title":"CAV."},{"key":"e_1_2_1_37_1","volume-title":"13th International Conference, OPODIS 2009, N\u00eemes, France, December 15-18, 2009. Proceedings. 300-314","author":"Milosevic Zarko","year":"2009","unstructured":"Zarko Milosevic , Martin Hutle , and Andr\u00e9 Schiper . 2009 . Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency. In Principles of Distributed Systems , 13th International Conference, OPODIS 2009, N\u00eemes, France, December 15-18, 2009. Proceedings. 300-314 . Zarko Milosevic, Martin Hutle, and Andr\u00e9 Schiper. 2009. Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency. In Principles of Distributed Systems, 13th International Conference, OPODIS 2009, N\u00eemes, France, December 15-18, 2009. Proceedings. 300-314."},{"key":"e_1_2_1_38_1","volume-title":"Lumi\u00e8re: Byzantine View Synchronization. CoRR abs\/","author":"Naor Oded","year":"2019","unstructured":"Oded Naor , Mathieu Baudet , Dahlia Malkhi , and Alexander Spiegelman . 2019 . Lumi\u00e8re: Byzantine View Synchronization. CoRR abs\/ 1909.05204 ( 2019 ). arXiv: 1909.05204 http:\/\/arxiv.org\/abs\/ 1909.05204 Oded Naor, Mathieu Baudet, Dahlia Malkhi, and Alexander Spiegelman. 2019. Lumi\u00e8re: Byzantine View Synchronization. CoRR abs\/ 1909.05204 ( 2019 ). arXiv: 1909.05204 http:\/\/arxiv.org\/abs\/ 1909.05204"},{"key":"e_1_2_1_39_1","volume-title":"Oki and Barbara Liskov","author":"Brian","year":"1988","unstructured":"Brian M. Oki and Barbara Liskov . 1988 . Viewstamped Replication : A General Primary Copy. In PODC. 8-17. Brian M. Oki and Barbara Liskov. 1988. Viewstamped Replication: A General Primary Copy. In PODC. 8-17."},{"key":"e_1_2_1_40_1","volume-title":"2014 USENIX Annual Technical Conference, USENIX ATC '14","author":"Ongaro Diego","year":"2014","unstructured":"Diego Ongaro and John K. Ousterhout . 2014. In Search of an Understandable Consensus Algorithm . In 2014 USENIX Annual Technical Conference, USENIX ATC '14 , Philadelphia, PA, USA , June 19-20, 2014 ., Garth Gibson and Nickolai Zeldovich (Eds.). 305-319. https:\/\/www.usenix.org\/conference\/atc14\/technical-sessions\/presentation\/ongaro Diego Ongaro and John K. Ousterhout. 2014. In Search of an Understandable Consensus Algorithm. In 2014 USENIX Annual Technical Conference, USENIX ATC '14, Philadelphia, PA, USA, June 19-20, 2014., Garth Gibson and Nickolai Zeldovich (Eds.). 305-319. https:\/\/www.usenix.org\/conference\/atc14\/technical-sessions\/presentation\/ongaro"},{"key":"e_1_2_1_41_1","first-page":"614","article-title":"Ivy: safety verification by interactive generalization","author":"Padon Oded","year":"2016","unstructured":"Oded Padon , Kenneth L. McMillan , Aurojit Panda , Mooly Sagiv , and Sharon Shoham . 2016 . Ivy: safety verification by interactive generalization . In PLDI. 614 - 630 . Oded Padon, Kenneth L. McMillan, Aurojit Panda, Mooly Sagiv, and Sharon Shoham. 2016. Ivy: safety verification by interactive generalization. In PLDI. 614-630.","journal-title":"PLDI."},{"key":"e_1_2_1_42_1","first-page":"304","article-title":"Time is not a healer","volume":"349","author":"Santoro Nicola","year":"1989","unstructured":"Nicola Santoro and Peter Widmayer . 1989 . Time is not a healer . In STACS (LNCS) , Vol. 349. 304 - 313 . Nicola Santoro and Peter Widmayer. 1989. Time is not a healer. In STACS (LNCS), Vol. 349. 304-313.","journal-title":"STACS (LNCS)"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.04.036"},{"key":"e_1_2_1_44_1","unstructured":"Daniele Sciascia. 2016. LibPaxos3. Retrieved July 9 2019 from https:\/\/bitbucket.org\/sciascid\/libpaxos\/ Daniele Sciascia. 2016. LibPaxos3. Retrieved July 9 2019 from https:\/\/bitbucket.org\/sciascid\/libpaxos\/"},{"key":"e_1_2_1_45_1","first-page":"277","volume-title":"Proceedings of the 22nd Annual International Conference on Supercomputing, ICS 2008, Island of Kos","author":"Shirako Jun","year":"2008","unstructured":"Jun Shirako , David M. Peixotto , Vivek Sarkar , and William N . III Scherer. 2008. Phasers: a unified deadlock-free construct for collective and point-to-point synchronization . In Proceedings of the 22nd Annual International Conference on Supercomputing, ICS 2008, Island of Kos , Greece , June 7-12, 2008 . 277 - 288 . Jun Shirako, David M. Peixotto, Vivek Sarkar, and William N. III Scherer. 2008. Phasers: a unified deadlock-free construct for collective and point-to-point synchronization. In Proceedings of the 22nd Annual International Conference on Supercomputing, ICS 2008, Island of Kos, Greece, June 7-12, 2008. 277-288."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01667080"},{"key":"e_1_2_1_47_1","first-page":"357","article-title":"Verifying Safety of Synchronous Fault-Tolerant Algorithms Bounded Model Checking. In TACAS","volume":"11428","author":"Stoilkovska Ilina","year":"2019","unstructured":"Ilina Stoilkovska , Igor Konnov , Josef Widder , and Florian Zuleger . 2019 . Verifying Safety of Synchronous Fault-Tolerant Algorithms Bounded Model Checking. In TACAS , Part II (LNCS) , Vol. 11428. 357 - 374 . Ilina Stoilkovska, Igor Konnov, Josef Widder, and Florian Zuleger. 2019. Verifying Safety of Synchronous Fault-Tolerant Algorithms Bounded Model Checking. In TACAS, Part II (LNCS), Vol. 11428. 357-374.","journal-title":"Part II (LNCS)"},{"key":"e_1_2_1_48_1","volume-title":"On the correctness of Egalitarian Paxos. CoRR abs\/","author":"Sutra Pierre","year":"1906","unstructured":"Pierre Sutra . 2019. On the correctness of Egalitarian Paxos. CoRR abs\/ 1906 .10917 ( 2019 ). http:\/\/arxiv.org\/abs\/ 1906.10917 Pierre Sutra. 2019. On the correctness of Egalitarian Paxos. CoRR abs\/ 1906.10917 ( 2019 ). http:\/\/arxiv.org\/abs\/ 1906.10917"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/227210.227229"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290372"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-009-0080-x"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"},{"key":"e_1_2_1_54_1","volume-title":"Data Inconsistency bug report ZOOKEEPER-2832. https:\/\/issues.apache.org\/jira\/browse\/ZOOKEEPER2832. accessed","author":"ZOOKEEPER","year":"2020","unstructured":"ZOOKEEPER 2017. Data Inconsistency bug report ZOOKEEPER-2832. https:\/\/issues.apache.org\/jira\/browse\/ZOOKEEPER2832. accessed May 2020 . ZOOKEEPER 2017. Data Inconsistency bug report ZOOKEEPER-2832. https:\/\/issues.apache.org\/jira\/browse\/ZOOKEEPER2832. accessed May 2020."}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3428281","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3428281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:58Z","timestamp":1750197778000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3428281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,13]]},"references-count":53,"journal-issue":{"issue":"OOPSLA","published-print":{"date-parts":[[2020,11,13]]}},"alternative-id":["10.1145\/3428281"],"URL":"https:\/\/doi.org\/10.1145\/3428281","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,13]]},"assertion":[{"value":"2020-11-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}