{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:14:40Z","timestamp":1763414080568,"version":"3.45.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111265","type":"print"},{"value":"9783032111272","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-11127-2_27","type":"book-chapter","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:54Z","timestamp":1763409834000},"page":"343-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Invited Paper: On the Equivalence of Snapshot\/Append Objects and Broadcast Abstractions under Byzantine Failures"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Kowalski","sequence":"first","affiliation":[]},{"given":"Achour","family":"Mostefaoui","sequence":"additional","affiliation":[]},{"given":"Matthieu","family":"Perrin","sequence":"additional","affiliation":[]},{"given":"Jolan","family":"Riallo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,18]]},"reference":[{"key":"27_CR1","unstructured":"Abraham, I., Malkhi, D., Nayak, K., Ren, L., Spiegelman, A.: Solida: a blockchain protocol based on reconfigurable byzantine consensus. In: Proceedings of 21st International Conference on Principles of Distributed Systems (OPODIS). LIPIcs, vol.\u00a095, pp. 25:1\u201325:19 (2017)"},{"issue":"4","key":"27_CR2","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H Attiya","year":"1995","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message-passing systems. J. ACM 42(1), 124\u2013142 (1995)","journal-title":"J. ACM"},{"key":"27_CR4","unstructured":"Auvolat, A., Raynal, M., Ta\u00efani, F.: Byzantine-tolerant set-constrained delivery broadcast. In: 23rd International Conference on Principles of Distributed Systems, OPODIS 2019, Neuch\u00e2tel, Switzerland. LIPIcs, vol.\u00a0153, pp. 6:1\u20136:23 (2019)"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/7351.7478","volume":"5","author":"KP Birman","year":"1987","unstructured":"Birman, K.P., Joseph, T.A.: Reliable communication in the presence of failures. ACM Trans. Comput. Syst. 5(1), 47\u201376 (1987)","journal-title":"ACM Trans. Comput. Syst."},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Bracha, G.: An asynchronous ($$n-1$$)\/3-resilient consensus protocol. In: Proceedings of 3rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 154\u2013162. ACM (1984)","DOI":"10.1145\/800222.806743"},{"key":"27_CR7","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Seltzer, M.I., Leach, P.J. (eds.) Proceedings of the 3rd USENIX Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, Louisiana, pp. 173\u2013186 (1999)"},{"issue":"2","key":"27_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM (JACM) 43(2), 225\u2013267 (1996)","journal-title":"J. ACM (JACM)"},{"key":"27_CR9","unstructured":"Cohen, S., Keidar, I.: Tame the wild with byzantine linearizability: reliable broadcast, snapshots, and asset transfer. In: 35th International Symposium on Distributed Computing (DISC). LIPIcs, vol.\u00a0209, pp. 18:1\u201318:18 (2021)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"D\u00e9pr\u00e9s, M., Most\u00e9faoui, A., Perrin, M., Raynal, M.: Brief announcement: the MBroadcast abstraction. In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC, Orlando, FL, USA, pp. 282\u2013285 (2023)","DOI":"10.1145\/3583668.3594569"},{"key":"27_CR11","unstructured":"D\u00e9pr\u00e9s, M., Most\u00e9faoui, A., Perrin, M., Raynal, M.: Send\/receive patterns versus read\/write patterns in crash-prone asynchronous distributed systems. In: 37th International Symposium on Distributed Computing, DISC 2023, L\u2019Aquila, Italy. LIPIcs, vol.\u00a0281, pp. 16:1\u201316:24 (2023)"},{"issue":"2\u20133","key":"27_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00446-003-0091-y","volume":"16","author":"FE Fich","year":"2003","unstructured":"Fich, F.E., Ruppert, E.: Hundreds of impossibility results for distributed computing. Distrib. Comput. 16(2\u20133), 121\u2013163 (2003)","journal-title":"Distrib. Comput."},{"key":"27_CR13","unstructured":"Hadzilacos, V., Toueg, S.: Fault-tolerant broadcasts and related problems. In: Mullender, S. (ed.) Distributed Systems, pp. 97\u2013145. ACM Press\/Addison-Wesley, 2 edn. (1993)"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2021.06.044","volume":"886","author":"D Imbs","year":"2021","unstructured":"Imbs, D., Most\u00e9faoui, A., Perrin, M., Raynal, M.: Set-constrained delivery broadcast: a communication abstraction for read\/write implementable distributed objects. Theor. Comput. Sci. 886, 49\u201368 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2016.03.012","volume":"93\u201394","author":"D Imbs","year":"2016","unstructured":"Imbs, D., Rajsbaum, S., Raynal, M., Stainer, J.: Read\/write shared memory abstraction on top of asynchronous byzantine message-passing systems. J. Parallel Distributed Comput. 93\u201394, 1\u20139 (2016)","journal-title":"J. Parallel Distributed Comput."},{"key":"27_CR16","unstructured":"Kowalski, V., Most\u00e9faoui, A., Perrin, M.: Atomic register abstractions for byzantine-prone distributed systems. In: 27th International Conference on Principles of Distributed Systems, OPODIS, Tokyo, Japan. LIPIcs, vol.\u00a0286 (2023)"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Kowalski, V., Most\u00e9faoui, A., Perrin, M.: Invited paper: causal mutual byzantine broadcast. In: Proceedings of the Workshop ApPLIED@PODC 2024 on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems, Nantes, France, pp.\u00a01\u20138. ACM (2024)","DOI":"10.1145\/3663338.3663679"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Kowalski, V., Most\u00e9faoui, A., Perrin, M.: An optimal byzantine SCD-broadcast protocol. In: 19th European Dependable Computing Conference, EDCC 2024, Leuven, Belgium, pp. 139\u2013146. IEEE (2024)","DOI":"10.1109\/EDCC61798.2024.00036"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Lynch, N.A.: A hundred impossibility proofs for distributed computing. In: Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, Canada, August 14-16, 1989, pp. 1\u201328 (1989)","DOI":"10.1145\/72981.72982"},{"issue":"4","key":"27_CR20","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s00224-016-9699-8","volume":"60","author":"A Most\u00e9faoui","year":"2017","unstructured":"Most\u00e9faoui, A., Petrolia, M., Raynal, M., Jard, C.: Atomic read\/write memory in signature-free byzantine asynchronous message-passing systems. Theory Comput. Syst. 60(4), 677\u2013694 (2017)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"27_CR21","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"issue":"4","key":"27_CR22","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"FB Schneider","year":"1990","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv. 22(4), 299\u2013319 (1990)","journal-title":"ACM Comput. Surv."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11127-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:55Z","timestamp":1763409835000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11127-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,18]]},"ISBN":["9783032111265","9783032111272"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11127-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,18]]},"assertion":[{"value":"18 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kathmandu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nepal","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":"9 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}