{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:13:44Z","timestamp":1750220024902,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:00:00Z","timestamp":1679875200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Research Council of Norway - Credence","award":["288126"],"award-info":[{"award-number":["288126"]}]},{"name":"Research Council of Norway - BBChain","award":["274451"],"award-info":[{"award-number":["274451"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,3,27]]},"DOI":"10.1145\/3555776.3578614","type":"proceedings-article","created":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T17:16:29Z","timestamp":1686158189000},"page":"121-124","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Extensible Framework for Implementing Byzantine Fault-Tolerant Protocols"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8524-161X","authenticated-orcid":false,"given":"Hanish","family":"Gogada","sequence":"first","affiliation":[{"name":"University of Stavanger, Stavanger, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4591-9606","authenticated-orcid":false,"given":"John","family":"Olsen","sequence":"additional","affiliation":[{"name":"University of Stavanger, Stavanger, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8564-2218","authenticated-orcid":false,"given":"Hein","family":"Meling","sequence":"additional","affiliation":[{"name":"University of Stavanger, Stavanger, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4465-540X","authenticated-orcid":false,"given":"Leander","family":"Jehl","sequence":"additional","affiliation":[{"name":"University of Stavanger, Stavanger, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","article-title":"The Next 700 BFT Protocols","volume":"32","author":"Aublin Pierre-Louis","year":"2015","unstructured":"Pierre-Louis Aublin , Rachid Guerraoui , Nikola Kne\u017eevi\u0107 , Vivien Qu\u00e9ma , and Marko Vukoli\u0107 . 2015 . The Next 700 BFT Protocols . ACM Trans. Comput. Syst. 32 , 4, Article 12 (jan 2015), 45 pages. Pierre-Louis Aublin, Rachid Guerraoui, Nikola Kne\u017eevi\u0107, Vivien Qu\u00e9ma, and Marko Vukoli\u0107. 2015. The Next 700 BFT Protocols. ACM Trans. Comput. Syst. 32, 4, Article 12 (jan 2015), 45 pages.","journal-title":"ACM Trans. Comput. Syst."},{"key":"e_1_3_2_1_2_1","unstructured":"Paulo S. L. M. Barreto Ben Lynn and Michael Scott. 2002. Constructing Elliptic Curves with Prescribed Embedding Degrees. Cryptology ePrint Archive Paper 2002\/088. https:\/\/eprint.iacr.org\/2002\/088 https:\/\/eprint.iacr.org\/2002\/088.  Paulo S. L. M. Barreto Ben Lynn and Michael Scott. 2002. Constructing Elliptic Curves with Prescribed Embedding Degrees. Cryptology ePrint Archive Paper 2002\/088. https:\/\/eprint.iacr.org\/2002\/088 https:\/\/eprint.iacr.org\/2002\/088."},{"key":"e_1_3_2_1_3_1","volume-title":"Alchieri","author":"Bessani Alysson","year":"2014","unstructured":"Alysson Bessani , Jo\u00e3o Sousa , and Eduardo E.P . Alchieri . 2014 . State Machine Replication for the Masses with BFT-SMART. In 2014 44th Annual IEEE\/IFIPICDSN. IEEE, Atlanta, GA, USA , 355--362. Alysson Bessani, Jo\u00e3o Sousa, and Eduardo E.P. Alchieri. 2014. State Machine Replication for the Masses with BFT-SMART. In 2014 44th Annual IEEE\/IFIPICDSN. IEEE, Atlanta, GA, USA, 355--362."},{"key":"e_1_3_2_1_4_1","unstructured":"Ethan Buchman. 2016. Tendermint: Byzantine Fault Tolerance in the Age of Blockchains. Ph.D. Dissertation. University of Guelph Guelph ON Canada.  Ethan Buchman. 2016. Tendermint: Byzantine Fault Tolerance in the Age of Blockchains. Ph.D. Dissertation. University of Guelph Guelph ON Canada."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Vitalik Buterin and Virgil Griffith. 2017. Casper the Friendly Finality Gadget. 10.48550\/ARXIV.1710.09437  Vitalik Buterin and Virgil Griffith. 2017. Casper the Friendly Finality Gadget. 10.48550\/ARXIV.1710.09437","DOI":"10.15291\/ai.1266"},{"volume-title":"OSDI (USA)","author":"Castro Miguel","key":"e_1_3_2_1_6_1","unstructured":"Miguel Castro and Barbara Liskov . 1999. Practical Byzantine Fault Tolerance . In OSDI (USA) . USENIX Association , USA , 173--186. Miguel Castro and Barbara Liskov. 1999. Practical Byzantine Fault Tolerance. In OSDI (USA). USENIX Association, USA, 173--186."},{"key":"e_1_3_2_1_7_1","unstructured":"Neil Giridharan Heidi Howard Ittai Abraham Natacha Crooks and Alin Tomescu. 2021. No-Commit Proofs: Defeating Livelock in BFT. Cryptology ePrint Archive Paper 2021\/1308. https:\/\/eprint.iacr.org\/2021\/1308  Neil Giridharan Heidi Howard Ittai Abraham Natacha Crooks and Alin Tomescu. 2021. No-Commit Proofs: Defeating Livelock in BFT. Cryptology ePrint Archive Paper 2021\/1308. https:\/\/eprint.iacr.org\/2021\/1308"},{"key":"e_1_3_2_1_8_1","unstructured":"Mohammad M. Jalalzai Jianyu Niu Chen Feng and Fangyu Gai. 2020. Fast-HotStuff: A Fast and Resilient HotStuff Protocol.  Mohammad M. Jalalzai Jianyu Niu Chen Feng and Fangyu Gai. 2020. Fast-HotStuff: A Fast and Resilient HotStuff Protocol."},{"volume-title":"Formal Verification of HotStuff","author":"Jehl Leander","key":"e_1_3_2_1_9_1","unstructured":"Leander Jehl . 2021. Formal Verification of HotStuff . In FORTE. Springer-Verlag , Berlin, Heidelberg , 197--204. Leander Jehl. 2021. Formal Verification of HotStuff. In FORTE. Springer-Verlag, Berlin, Heidelberg, 197--204."},{"key":"e_1_3_2_1_10_1","article-title":"Zyzzyva: Speculative Byzantine Fault Tolerance","volume":"27","author":"Kotla Ramakrishna","year":"2010","unstructured":"Ramakrishna Kotla , Lorenzo Alvisi , Mike Dahlin , Allen Clement , and Edmund Wong . 2010 . Zyzzyva: Speculative Byzantine Fault Tolerance . ACM Trans. Comput. Syst. 27 , 4, Article 7 (2010), 39 pages. Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, and Edmund Wong. 2010. Zyzzyva: Speculative Byzantine Fault Tolerance. ACM Trans. Comput. Syst. 27, 4, Article 7 (2010), 39 pages.","journal-title":"ACM Trans. Comput. Syst."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","article-title":"The Byzantine Generals Problem","volume":"4","author":"Lamport Leslie","year":"1982","unstructured":"Leslie Lamport , Robert Shostak , and Marshall Pease . 1982 . The Byzantine Generals Problem . ACM Trans. Program. Lang. Syst. 4 , 3 (1982), 382 -- 401 . Leslie Lamport, Robert Shostak, and Marshall Pease. 1982. The Byzantine Generals Problem. ACM Trans. Program. Lang. Syst. 4, 3 (1982), 382--401.","journal-title":"ACM Trans. Program. Lang. Syst."},{"volume-title":"Towards New Abstractions for Implementing Quorum-Based Systems","author":"Lea Tormod Erevik","key":"e_1_3_2_1_12_1","unstructured":"Tormod Erevik Lea , Leander Jehl , and Hein Meling . 2017. Towards New Abstractions for Implementing Quorum-Based Systems . In ICDCS. IEEE , USA , 2380--2385. Tormod Erevik Lea, Leander Jehl, and Hein Meling. 2017. Towards New Abstractions for Implementing Quorum-Based Systems. In ICDCS. IEEE, USA, 2380--2385."},{"key":"e_1_3_2_1_13_1","volume-title":"Measuring reproducibility in computer systems research. PLoS Comput Biol 9","author":"Moraila Gina","year":"2014","unstructured":"Gina Moraila , Akash Shankaran , Zuoming Shi , and Alex M Warren . 2014. Measuring reproducibility in computer systems research. PLoS Comput Biol 9 ( 2014 ), 37 pages. Gina Moraila, Akash Shankaran, Zuoming Shi, and Alex M Warren. 2014. Measuring reproducibility in computer systems research. PLoS Comput Biol 9 (2014), 37 pages."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN53405.2022.00018"},{"key":"e_1_3_2_1_16_1","unstructured":"The Diem Team. 2021. DiemBFT v4: State Machine Replication in the Diem Blockchain.  The Diem Team. 2021. DiemBFT v4: State Machine Replication in the Diem Blockchain."},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. ACM Program. Lang. 2, OOPSLA, Article 129","author":"Weisenburger Pascal","year":"2018","unstructured":"Pascal Weisenburger , Mirko K\u00f6hler , and Guido Salvaneschi . 2018 . Distributed System Development with ScalaLoci . Proc. ACM Program. Lang. 2, OOPSLA, Article 129 (2018), 30 pages. Pascal Weisenburger, Mirko K\u00f6hler, and Guido Salvaneschi. 2018. Distributed System Development with ScalaLoci. Proc. ACM Program. Lang. 2, OOPSLA, Article 129 (2018), 30 pages."},{"key":"e_1_3_2_1_18_1","volume-title":"HotStuff: BFT Consensus with Linearity and Responsiveness. In PODC '19 (Canada). ACM, USA, 347--356","author":"Yin Maofan","year":"2019","unstructured":"Maofan Yin , Dahlia Malkhi , Michael K. Reiter , Guy Golan Gueta , and Ittai Abraham . 2019 . HotStuff: BFT Consensus with Linearity and Responsiveness. In PODC '19 (Canada). ACM, USA, 347--356 . Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan Gueta, and Ittai Abraham. 2019. HotStuff: BFT Consensus with Linearity and Responsiveness. In PODC '19 (Canada). ACM, USA, 347--356."},{"volume-title":"Correct Hardware Design and Verification Methods","author":"Yu Yuan","key":"e_1_3_2_1_19_1","unstructured":"Yuan Yu , Panagiotis Manolios , and Leslie Lamport . 1999. Model Checking TLA+ Specifications . In Correct Hardware Design and Verification Methods . Springer, Berlin , Heidelberg , 54--66. Yuan Yu, Panagiotis Manolios, and Leslie Lamport. 1999. Model Checking TLA+ Specifications. In Correct Hardware Design and Verification Methods. Springer, Berlin, Heidelberg, 54--66."}],"event":{"name":"SAC '23: 38th ACM\/SIGAPP Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Tallinn Estonia","acronym":"SAC '23"},"container-title":["Proceedings of the 38th ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555776.3578614","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3555776.3578614","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:35Z","timestamp":1750182695000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555776.3578614"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,27]]},"references-count":19,"alternative-id":["10.1145\/3555776.3578614","10.1145\/3555776"],"URL":"https:\/\/doi.org\/10.1145\/3555776.3578614","relation":{},"subject":[],"published":{"date-parts":[[2023,3,27]]},"assertion":[{"value":"2023-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}