{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:20:55Z","timestamp":1775913655761,"version":"3.50.1"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031937057","type":"print"},{"value":"9783031937064","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-93706-4_9","type":"book-chapter","created":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T17:22:55Z","timestamp":1749316975000},"page":"138-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reusable Formal Verification of\u00a0DAG-Based Consensus Protocols"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9957-5394","authenticated-orcid":false,"given":"Nathalie","family":"Bertrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-0421-4490","authenticated-orcid":false,"given":"Pranav","family":"Ghorpade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3948-129X","authenticated-orcid":false,"given":"Sasha","family":"Rubin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7672-7359","authenticated-orcid":false,"given":"Bernhard","family":"Scholz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6536-3932","authenticated-orcid":false,"given":"Pavle","family":"Suboti\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,8]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-642-13977-2_4","volume-title":"Tests and Proofs","author":"KY Ahn","year":"2010","unstructured":"Ahn, K.Y., Denney, E.: Testing first-order logic axioms in program verification. In: Fraser, G., Gargantini, A. (eds.) TAP 2010. LNCS, vol. 6143, pp. 22\u201337. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13977-2_4"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-73721-8_1","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"B Aminof","year":"2018","unstructured":"Aminof, B., Rubin, S., Stoilkovska, I., Widder, J., Zuleger, F.: Parameterized model checking of synchronous distributed algorithms by abstraction. In: VMCAI 2018. LNCS, vol. 10747, pp. 1\u201324. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73721-8_1"},{"key":"9_CR3","unstructured":"Aptos Foundation: Understanding Aptos: A comprehensive overview (2024). https:\/\/messari.io\/report\/understanding-aptos-a-comprehensive-overview"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Baird, L., Luykx, A.: The hashgraph protocol: efficient asynchronous BFT for high-throughput distributed ledgers. In: Proceedings of COINS 2020, pp.\u00a01\u20137. IEEE (2020). https:\/\/doi.org\/10.1109\/COINS49042.2020.9191430","DOI":"10.1109\/COINS49042.2020.9191430"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bandarupalli, A., Bhat, A., Bagchi, S., Kate, A., Reiter, M.K.: Random beacons in Monte Carlo: efficient asynchronous random beacon without threshold cryptography (version 1) (2024). https:\/\/doi.org\/10.5281\/zenodo.11044395","DOI":"10.1145\/3658644.3670326"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Bertrand, N., Gramoli, V., Konnov, I., Lazic, M., Tholoniat, P., Widder, J.: Holistic verification of blockchain consensus. In: Scheideler, C. (ed.) 36th International Symposium on Distributed Computing, DISC 2022, Augusta, Georgia, USA, 25\u201327 October 2022. LIPIcs, vol.\u00a0246, pp. 10:1\u201310:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.DISC.2022.10","DOI":"10.4230\/LIPICS.DISC.2022.10"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Bloem, R., et al.: Decidability of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers (2015). https:\/\/doi.org\/10.2200\/S00658ED1V01Y201508DCT013","DOI":"10.2200\/S00658ED1V01Y201508DCT013"},{"issue":"6","key":"9_CR8","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","volume":"52","author":"S Boyd","year":"2006","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Trans. Inf. Theory 52(6), 2508\u20132530 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.874516","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Braithwaite, S., et al.: Formal specification and model checking of the tendermint blockchain synchronization protocol (short paper). In: Bernardo, B., Marmsoler, D. (eds.) 2nd Workshop on Formal Methods for Blockchains, FMBC@CAV 2020, Los Angeles, California, USA, 20\u201321 July 2020 (Virtual Conference). OASIcs, vol.\u00a084, pp. 10:1\u201310:8. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/OASICS.FMBC.2020.10","DOI":"10.4230\/OASICS.FMBC.2020.10"},{"key":"9_CR10","unstructured":"Buterin, V.: Ethereum white paper: a next generation smart contract & decentralized application platform (2013). https:\/\/github.com\/ethereum\/wiki\/wiki\/White-Paper"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-319-48989-6_8","volume-title":"FM 2016: Formal Methods","author":"S Chand","year":"2016","unstructured":"Chand, S., Liu, Y.A., Stoller, S.D.: Formal verification of multi-paxos for distributed consensus. In: Fitzgerald, J., Heitmeyer, C., Gnesi, S., Philippou, A. (eds.) FM 2016. LNCS, vol. 9995, pp. 119\u2013136. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48989-6_8"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Coelho, P., Junior, T.C., Bessani, A., Dotti, F., Pedone, F.: Byzantine fault-tolerant atomic multicast. In: 2018 48th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 39\u201350 (2018). https:\/\/doi.org\/10.1109\/DSN.2018.00017","DOI":"10.1109\/DSN.2018.00017"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Coquand, T., Huet, G.P.: The calculus of constructions. Inf. Comput. 76(2\/3), 95\u2013120 (1988). https:\/\/doi.org\/10.1016\/0890-5401(88)90005-3","DOI":"10.1016\/0890-5401(88)90005-3"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-32759-9_14","volume-title":"FM 2012: Formal Methods","author":"D Cousineau","year":"2012","unstructured":"Cousineau, D., Doligez, D., Lamport, L., Merz, S., Ricketts, D., Vanzetto, H.: TLA+ proofs. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 147\u2013154. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_14"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Crain, T., Natoli, C., Gramoli, V.: Red belly: a secure, fair and scalable open blockchain. In: 42nd IEEE Symposium on Security and Privacy, SP 2021, San Francisco, CA, USA, 24\u201327 May 2021, pp. 466\u2013483. IEEE (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00087","DOI":"10.1109\/SP40001.2021.00087"},{"key":"9_CR16","unstructured":"Crary, K.: Verifying the hashgraph consensus algorithm. Technical report, CMU (2021). https:\/\/arxiv.org\/abs\/2102.01167"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Cristian, F., Aghili, H., Strong, R., Dolev, D.: Atomic broadcast: from simple message diffusion to byzantine agreement. Inf. Comput. 118(1), 158\u2013179 (1995). https:\/\/doi.org\/10.1006\/inco.1995.1060. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540185710607","DOI":"10.1006\/inco.1995.1060"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Dai, X., et al.: LightDAG: a low-latency DAG-based BFT consensus through lightweight broadcast. Cryptology ePrint Archive, Paper 2024\/160 (2024). https:\/\/eprint.iacr.org\/2024\/160","DOI":"10.1109\/IPDPS57955.2024.00093"},{"key":"9_CR19","unstructured":"Fantom Foundation: Lachesis aBFT (2024). https:\/\/docs.fantom.foundation\/technology\/lachesis-abft"},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Gagol, A., Lesniak, D., Straszak, D., Swietek, M.: Aleph: efficient atomic broadcast in asynchronous networks with Byzantine nodes. In: Proceedings of the 1st ACM Conference on Advances in Financial Technologies, AFT 2019, Zurich, Switzerland, 21\u201323 October 2019, pp. 214\u2013228. ACM (2019). https:\/\/doi.org\/10.1145\/3318041.3355467","DOI":"10.1145\/3318041.3355467"},{"key":"9_CR22","unstructured":"Geko, C.: Ethereum white paper: A next generation smart contract & decentralized application platform (2024). https:\/\/www.coingecko.com\/en\/chains"},{"key":"9_CR23","unstructured":"Ghorpade, P.: Reusable-Formal-Verification-of-DAG-based-Consensus (2024). https:\/\/github.com\/pranavg5526\/Reusable-Formal-Verification-of-DAG-based-Consensus"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: scaling Byzantine agreements for cryptocurrencies. In: Proceedings of SOSP 2017, pp. 51\u201368. ACM (2017). https:\/\/doi.org\/10.1145\/3132747.3132757","DOI":"10.1145\/3132747.3132757"},{"key":"9_CR25","unstructured":"Giridharan, N., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A.: Bullshark: Dag BFT protocols made practical. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (2022). https:\/\/api.semanticscholar.org\/CorpusID:246015617"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Hackett, F., Rowe, J., Kuppe, M.A.: Understanding inconsistency in azure cosmos DB with TLA+. In: 2023 IEEE\/ACM 45th International Conference on Software Engineering: Software Engineering in Practice (ICSE-SEIP), pp. 1\u201312 (2023). https:\/\/doi.org\/10.1109\/ICSE-SEIP58684.2023.00006","DOI":"10.1109\/ICSE-SEIP58684.2023.00006"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Hawblitzel, C., et al.: Ironfleet: proving practical distributed systems correct. In: Proceedings of the 25th Symposium on Operating Systems Principles, SOSP 2015, pp. 1\u201317. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2815400.2815428","DOI":"10.1145\/2815400.2815428"},{"key":"9_CR28","unstructured":"Hedra: Streamlining consensus (2024). https:\/\/hedera.com\/blog\/streamlining-consensus-throughput-and-lower-latency-with-about-half-the-events"},{"key":"9_CR29","doi-asserted-by":"publisher","unstructured":"Keidar, I., Kokoris-Kogias, E., Naor, O., Spiegelman, A.: All you need is DAG. In: Proceedings of PODC 2021, pp. 165\u2013175. ACM (2021). https:\/\/doi.org\/10.1145\/3465084.3467905","DOI":"10.1145\/3465084.3467905"},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Keidar, I., Naor, O., Poupko, O., Shapiro, E.: Cordial miners: fast and efficient consensus for every eventuality. In: Oshman, R. (ed.) 37th International Symposium on Distributed Computing, DISC 2023, L\u2019Aquila, Italy, 10\u201312 October 2023. LIPIcs, vol.\u00a0281, pp. 26:1\u201326:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.DISC.2023.26","DOI":"10.4230\/LIPICS.DISC.2023.26"},{"key":"9_CR31","doi-asserted-by":"publisher","unstructured":"Keidar, I., Naor, O., Poupko, O., Shapiro, E.: Cordial miners: fast and efficient consensus for every eventuality. In: Proceeding of 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0281, pp. 26:1\u201326:22. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2023.26","DOI":"10.4230\/LIPIcs.DISC.2023.26"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Konnov, I., Kukovec, J., Tran, T.H.: TLA+ model checking made symbolic. Proc. ACM Program. Lang. 3(OOPSLA) (2019). https:\/\/doi.org\/10.1145\/3360549","DOI":"10.1145\/3360549"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Konnov, I.V., Lazic, M., Veith, H., Widder, J.: A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms. In: Castagna, G., Gordon, A.D. (eds.) Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, 18\u201320 January 2017, pp. 719\u2013734. ACM (2017). https:\/\/doi.org\/10.1145\/3009837.3009860","DOI":"10.1145\/3009837.3009860"},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"Kumar, A., Kumar\u00a0Sah, B., Mehrotra, T., Rajput, G.K.: A review on double spending problem in blockchain. In: 2023 International Conference on Computational Intelligence and Sustainable Engineering Solutions (CISES), pp. 881\u2013889 (2023). https:\/\/doi.org\/10.1109\/CISES58720.2023.10183579","DOI":"10.1109\/CISES58720.2023.10183579"},{"key":"9_CR35","unstructured":"Kwon, J.: Tendermint: consensus without mining (2014). https:\/\/tendermint.com\/docs\/tendermint.pdf"},{"key":"9_CR36","unstructured":"Lamport, L.: Specifying Systems, The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley (2002). http:\/\/research.microsoft.com\/users\/lamport\/tla\/book.html"},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Lokhava, M., et al.: Fast and secure global payments with stellar. In: Brecht, T., Williamson, C. (eds.) Proceedings of the 27th ACM Symposium on Operating Systems Principles, SOSP 2019, Huntsville, ON, Canada, 27\u201330 October 2019, pp. 80\u201396. ACM (2019). https:\/\/doi.org\/10.1145\/3341301.3359636","DOI":"10.1145\/3341301.3359636"},{"key":"9_CR38","doi-asserted-by":"publisher","unstructured":"Losa, G., Dodds, M.: On the formal verification of the stellar consensus protocol. In: Bernardo, B., Marmsoler, D. (eds.) 2nd Workshop on Formal Methods for Blockchains, FMBC@CAV 2020, Los Angeles, California, USA, 20\u201321 July 2020 (Virtual Conference). OASIcs, vol.\u00a084, pp. 9:1\u20139:9. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/OASICS.FMBC.2020.9","DOI":"10.4230\/OASICS.FMBC.2020.9"},{"key":"9_CR39","doi-asserted-by":"publisher","unstructured":"Milosevic, Z., Hutle, M., Schiper, A.: On the reduction of atomic broadcast to consensus with byzantine faults. In: 2011 IEEE 30th International Symposium on Reliable Distributed Systems, pp. 235\u2013244 (2011). https:\/\/doi.org\/10.1109\/SRDS.2011.36","DOI":"10.1109\/SRDS.2011.36"},{"key":"9_CR40","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)"},{"key":"9_CR41","doi-asserted-by":"publisher","unstructured":"Neu, J., Tas, E.N., Tse, D.: Two more attacks on proof-of-stake ghost\/ethereum. In: Proceedings of the 2022 ACM Workshop on Developments in Consensus, ConsensusDay 2022, pp. 43\u201352. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3560829.3563560","DOI":"10.1145\/3560829.3563560"},{"key":"9_CR42","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-662-43652-3_3","volume-title":"Abstract State Machines, Alloy, B, TLA, VDM, and Z","author":"C Newcombe","year":"2014","unstructured":"Newcombe, C.: Why amazon chose TLA+. In: Ait Ameur, Y., Schewe, K.D. (eds.) Abstract State Machines, Alloy, B, TLA, VDM, and Z, pp. 25\u201339. Springer, Heidelberg (2014)"},{"key":"9_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL","year":"2002","unstructured":"Nipkow, T., Wenzel, M., Paulson, L.C. (eds.): Isabelle\/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45949-9"},{"key":"9_CR44","doi-asserted-by":"publisher","unstructured":"P\u00eerlea, G., Sergey, I.: Mechanising blockchain consensus. In: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, pp. 78\u201390. Association for Computing Machinery, New York (2018). https:\/\/doi.org\/10.1145\/3167086","DOI":"10.1145\/3167086"},{"key":"9_CR45","doi-asserted-by":"publisher","unstructured":"Praveen, M., Ramesh, R., Doidge, I.: Formally verifying the safety of pipelined moonshot consensus protocol. In: Bernardo, B., Marmsoler, D. (eds.) 5th International Workshop on Formal Methods for Blockchains (FMBC 2024). Open Access Series in Informatics (OASIcs), vol.\u00a0118, pp. 3:1\u20133:16. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/OASIcs.FMBC.2024.3. https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/OASIcs.FMBC.2024.3","DOI":"10.4230\/OASIcs.FMBC.2024.3"},{"key":"9_CR46","doi-asserted-by":"publisher","unstructured":"Raikwar, M., Polyanskii, N., M\u00fcller, S.: SoK: Dag-based consensus protocols. In: 2024 IEEE International Conference on Blockchain and Cryptocurrency (ICBC), pp. 1\u201318 (2024). https:\/\/doi.org\/10.1109\/ICBC59979.2024.10634358","DOI":"10.1109\/ICBC59979.2024.10634358"},{"key":"9_CR47","doi-asserted-by":"publisher","unstructured":"Schultz, W., Dardik, I., Tripakis, S.: Formal verification of a distributed dynamic reconfiguration protocol. In: Popescu, A., Zdancewic, S. (eds.) CPP 2022: 11th ACM SIGPLAN International Conference on Certified Programs and Proofs, Philadelphia, PA, USA, 17\u201318 January 2022, pp. 143\u2013152. ACM (2022). https:\/\/doi.org\/10.1145\/3497775.3503688","DOI":"10.1145\/3497775.3503688"},{"key":"9_CR48","unstructured":"Shoup, V.: Blue fish, red fish, live fish, dead fish. Cryptology ePrint Archive, Paper 2024\/1235 (2024). https:\/\/eprint.iacr.org\/2024\/1235"},{"key":"9_CR49","doi-asserted-by":"publisher","first-page":"21","DOI":"10.4018\/jdm.2005070102","volume":"16","author":"P Soffer","year":"2005","unstructured":"Soffer, P.: Refinement equivalence in model-based reuse: overcoming differences in abstraction level. J. Database Manag. 16, 21\u201339 (2005)","journal-title":"J. Database Manag."},{"key":"9_CR50","doi-asserted-by":"crossref","unstructured":"Thomsen, S.E., Spitters, B.: Formalizing nakamoto-style proof of stake. In: 2021 IEEE 34th Computer Security Foundations Symposium (CSF), pp. 1\u201315 (2020). https:\/\/api.semanticscholar.org\/CorpusID:220713445","DOI":"10.1109\/CSF51468.2021.00042"},{"key":"9_CR51","doi-asserted-by":"publisher","unstructured":"Wang, D., Dou, W., Gao, Y., Wu, C., Wei, J., Huang, T.: Model checking guided testing for distributed systems. In: Proceedings of the Eighteenth European Conference on Computer Systems, EuroSys 2023, pp. 127\u2013143. Association for Computing Machinery, New York (2023). https:\/\/doi.org\/10.1145\/3552326.3587442","DOI":"10.1145\/3552326.3587442"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-93706-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T17:23:01Z","timestamp":1749316981000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-93706-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031937057","9783031937064"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-93706-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"8 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hampton Roads, VA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/shemesh.larc.nasa.gov\/nfm2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}