{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:42Z","timestamp":1750219842790,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T00:00:00Z","timestamp":1683504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,5,8]]},"DOI":"10.1145\/3578358.3592148","type":"proceedings-article","created":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T20:51:58Z","timestamp":1683060718000},"page":"9-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Trees and Turtles: Modular Abstractions for State Machine Replication Protocols"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9701-9876","authenticated-orcid":false,"given":"Natalie","family":"Neamtu","sequence":"first","affiliation":[{"name":"Microsoft Corporation, Redmond, WA, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7718-7905","authenticated-orcid":false,"given":"Haobin","family":"Ni","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3598-0283","authenticated-orcid":false,"given":"Robbert","family":"Van Renesse","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2023,5,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. of the 2nd ACM Symp. on Principles of Distributed Computing. ACM SIGOPS-SIGACT, ACM Press, Montreal, Quebec, 27--30","author":"Ben-Or M.","year":"1983","unstructured":"M. Ben-Or . 1983 . Another advantage of free choice: Completely Asynchronous Agreement Protocols . In Proc. of the 2nd ACM Symp. on Principles of Distributed Computing. ACM SIGOPS-SIGACT, ACM Press, Montreal, Quebec, 27--30 . M. Ben-Or. 1983. Another advantage of free choice: Completely Asynchronous Agreement Protocols. In Proc. of the 2nd ACM Symp. on Principles of Distributed Computing. ACM SIGOPS-SIGACT, ACM Press, Montreal, Quebec, 27--30."},{"volume-title":"Proc. of the 2nd ACM Symp. on Principles of Distributed Computing. ACM SIGOPS-SIGACT, Montreal, Quebec, 12--26","author":"Bracha G.","key":"e_1_3_2_1_2_1","unstructured":"G. Bracha and S. Toueg . 1983. Resilient Consensus Protocols . In Proc. of the 2nd ACM Symp. on Principles of Distributed Computing. ACM SIGOPS-SIGACT, Montreal, Quebec, 12--26 . G. Bracha and S. Toueg. 1983. Resilient Consensus Protocols. In Proc. of the 2nd ACM Symp. on Principles of Distributed Computing. ACM SIGOPS-SIGACT, Montreal, Quebec, 12--26."},{"volume-title":"Consensus in One Communication Step. In PaCT '01: Proceedings of the 6th International Conference on Parallel Computing Technologies. Springer-Verlag","author":"Brasileiro F.V.","key":"e_1_3_2_1_3_1","unstructured":"F.V. Brasileiro , F. Greve , A. Most\u00e9faoui , and M. Raynal . 2001 . Consensus in One Communication Step. In PaCT '01: Proceedings of the 6th International Conference on Parallel Computing Technologies. Springer-Verlag , London, UK, 42--50. F.V. Brasileiro, F. Greve, A. Most\u00e9faoui, and M. Raynal. 2001. Consensus in One Communication Step. In PaCT '01: Proceedings of the 6th International Conference on Parallel Computing Technologies. Springer-Verlag, London, UK, 42--50."},{"volume-title":"Proc. of the 3rd Symposium on Operating Systems Design and Implementation (OSDI'99)","author":"Castro M.","key":"e_1_3_2_1_4_1","unstructured":"M. Castro and B. Liskov . 1999. Practical Byzantine Fault Tolerance . In Proc. of the 3rd Symposium on Operating Systems Design and Implementation (OSDI'99) . USENIX, New Orleans, LA. M. Castro and B. Liskov. 1999. Practical Byzantine Fault Tolerance. In Proc. of the 3rd Symposium on Operating Systems Design and Implementation (OSDI'99). USENIX, New Orleans, LA."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"volume-title":"Proceedings of the 2nd Symposium on Principles of Database Systems (PODS'83)","author":"Fischer M.J.","key":"e_1_3_2_1_6_1","unstructured":"M.J. Fischer , N.A. Lynch , and M.S. Patterson . 1983. Impossibility of Distributed Consensus with one Faulty Process . In Proceedings of the 2nd Symposium on Principles of Database Systems (PODS'83) . ACM SIGACT-SIGMOD, Atlanta, GA. M.J. Fischer, N.A. Lynch, and M.S. Patterson. 1983. Impossibility of Distributed Consensus with one Faulty Process. In Proceedings of the 2nd Symposium on Principles of Database Systems (PODS'83). ACM SIGACT-SIGMOD, Atlanta, GA."},{"volume-title":"Proceedings of the 11th Euro-Par Conference (Lecture Notes on Computer Science, 3648)","author":"Junqueira F.P.","key":"e_1_3_2_1_7_1","unstructured":"F.P. Junqueira and K. Marzullo . 2005. Replication predicates for dependent-failure algorithms . In Proceedings of the 11th Euro-Par Conference (Lecture Notes on Computer Science, 3648) . Springer-Verlag, Monte de Caparica, Portugal, 617--632. F.P. Junqueira and K. Marzullo. 2005. Replication predicates for dependent-failure algorithms. In Proceedings of the 11th Euro-Par Conference (Lecture Notes on Computer Science, 3648). Springer-Verlag, Monte de Caparica, Portugal, 617--632."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2011.5958223"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_3_2_1_10_1","unstructured":"L. Lamport. 2005. Generalized consensus and Paxos. (2005).  L. Lamport. 2005. Generalized consensus and Paxos. (2005)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-006-0005-x"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"N. Neamtu H. Ni and R. van Renesse. 2023. Trees and Turtles: Modular Abstractions for State Machine Replication Protocols. arXiv:2304.07850 [cs.DC]  N. Neamtu H. Ni and R. van Renesse. 2023. Trees and Turtles: Modular Abstractions for State Machine Replication Protocols. arXiv:2304.07850 [cs.DC]","DOI":"10.1145\/3578358.3592148"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"event":{"name":"PaPoC '23: 10th Workshop on Principles and Practice of Consistency for Distributed Data","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Rome Italy","acronym":"PaPoC '23"},"container-title":["Proceedings of the 10th Workshop on Principles and Practice of Consistency for Distributed Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3578358.3592148","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:52Z","timestamp":1750178812000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3578358.3592148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,8]]},"references-count":14,"alternative-id":["10.1145\/3578358.3592148","10.1145\/3578358"],"URL":"https:\/\/doi.org\/10.1145\/3578358.3592148","relation":{},"subject":[],"published":{"date-parts":[[2023,5,8]]},"assertion":[{"value":"2023-05-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}