{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:03:47Z","timestamp":1743087827813,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031258022"},{"type":"electronic","value":"9783031258039"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-25803-9_4","type":"book-chapter","created":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T20:10:16Z","timestamp":1675195816000},"page":"52-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Sequentialization Procedure for\u00a0Fault-Tolerant Protocols"],"prefix":"10.1007","author":[{"given":"Cezara","family":"Dr\u01cegoi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9404-7077","authenticated-orcid":false,"given":"Patricio","family":"Inzaghi Pronesti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,1]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Padon, O., McMillan, K.L., Panda, A., Sagiv, M., Shoham, S.: Ivy: safety verification by interactive generalization. In: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 614\u2013630 (2016). https:\/\/doi.org\/10.1145\/2908080.2908118","DOI":"10.1145\/2908080.2908118"},{"issue":"5","key":"4_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"GJ Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The model checker SPIN. IEEE Trans. Softw. Eng. 23(5), 279\u2013295 (1997)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"4_CR3","unstructured":"Deligiannis, P., et al.: Uncovering bugs in distributed storage systems during testing (not in production!). In: Proceedings of the 14th Usenix Conference on File and Storage Technologies, pp. 249\u2013262. FAST 2016. USENIX Association (2016)"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Desai, A., Gupta, V., Jackson, E., Qadeer, S., Rajamani, S., Zufferey, D.: P: safe asynchronous event-driven programming. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ser. PLDI 2013, pp. 321\u2013332. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2491956.2462184","DOI":"10.1145\/2491956.2462184"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-23702-7_13","volume-title":"Static Analysis","author":"A Bouajjani","year":"2011","unstructured":"Bouajjani, A., Emmi, M., Parlato, G.: On sequentializing concurrent programs. In: Yahav, E. (ed.) SAS 2011. LNCS, vol. 6887, pp. 129\u2013145. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23702-7_13"},{"issue":"6","key":"4_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/996893.996845","volume":"39","author":"S Qadeer","year":"2004","unstructured":"Qadeer, S., Wu, D.: KISS: keep it simple and sequential. ACM SIGPLAN Not. 39(6), 14\u201324 (2004)","journal-title":"ACM SIGPLAN Not."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.entcs.2007.05.038","volume":"188","author":"M Bertran","year":"2007","unstructured":"Bertran, M., Babot, F., Climent, A.: Formal sequentialization of distributed systems via program rewriting. Electr. Notes Theor. Comput. Sci. 188, 53\u201375 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"OOPSLA","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3133934","volume":"1","author":"A Bakst","year":"2017","unstructured":"Bakst, A., Gleissenthall, K.V., K\u0131c\u0131, R.G., Jhala, R.: Verifying distributed programs via canonical sequentialization. Proc. ACM Program. Lang. 1(OOPSLA), 1\u201327 (2017). https:\/\/doi.org\/10.1145\/3133934","journal-title":"Proc. ACM Program. Lang."},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Kragl, B., Enea, C., Henzinger, T.A., Mutluergil, S.O., Qadeer, S.: Inductive sequentialization of asynchronous programs. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 227\u2013242 (2020). https:\/\/doi.org\/10.1145\/3385412.3385980","DOI":"10.1145\/3385412.3385980"},{"issue":"3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0167-6423(83)90013-8","volume":"2","author":"T Elrad","year":"1982","unstructured":"Elrad, T., Francez, N.: Decomposition of distributed programs into communication-closed layers. Sci. Comput. Program. 2(3), 155\u2013173 (1982)","journal-title":"Sci. Comput. Program."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Biely, M., Delgado, P., Milosevic, Z., Schiper, A.: Distal: a framework for implementing fault-tolerant distributed algorithms. In: 2013 43rd Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 1\u20138. IEEE (2013)","DOI":"10.1109\/DSN.2013.6575306"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-030-25543-5_20","volume-title":"Computer Aided Verification","author":"A Damian","year":"2019","unstructured":"Damian, A., Dr\u0103goi, C., Militaru, A., Widder, J.: Communication-closed asynchronous protocols. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11562, pp. 344\u2013363. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25543-5_20"},{"key":"4_CR13","unstructured":"Lamport, L.: Paxos made simple. ACM SIGACT News (Distributed Computing Column) 32, 4 (Whole Number 121, December 2001) (2001). https:\/\/www.microsoft.com\/en-us\/research\/publication\/paxos-made-simple\/"},{"key":"4_CR14","unstructured":"Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm. In: 2014 USENIX Annual Technical Conference (Usenix ATC 2014), pp. 305\u2013319 (2014)"},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/850770.850772","volume":"19","author":"C Mohan","year":"1985","unstructured":"Mohan, C., Lindsay, B.: Efficient commit protocols for the tree of processes model of distributed transactions. ACM SIGOPS Oper. Syst. Rev. 19(2), 40\u201352 (1985). https:\/\/doi.org\/10.1145\/850770.850772","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Junqueira, F.P., Reed, B.C., Serafini, M.: Zab: high-performance broadcast for primary-backup systems. In: 2011 IEEE\/IFIP 41st International Conference on Dependable Systems & Networks (DSN), pp. 245\u2013256. IEEE (2011). http:\/\/ieeexplore.ieee.org\/document\/5958223\/","DOI":"10.1109\/DSN.2011.5958223"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3428278","volume":"4","author":"C Dr\u0103goi","year":"2020","unstructured":"Dr\u0103goi, C., Enea, C., Ozkan, B.K., Majumdar, R., Niksic, F.: Testing consensus implementations using communication closure. Proc. ACM Program. Lang. 4, 1\u201329 (2020). https:\/\/doi.org\/10.1145\/3428278","journal-title":"Proc. ACM Program. Lang."},{"key":"4_CR18","unstructured":"Ongaro, D.: Consensus: bridging theory and practice. Stanford University, CA, USA (2014). aAI28121474 ISBN-13: 9798662514218"},{"issue":"POPL","key":"4_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3290372","volume":"3","author":"KV Gleissenthall","year":"2019","unstructured":"Gleissenthall, K.V., K\u0131c\u0131, R.G., Bakst, A., Stefan, D., Jhala, R.: Pretend synchrony: synchronous verification of asynchronous distributed programs. Proc. ACM Program. Lang. 3(POPL), 1\u201330 (2019)","journal-title":"Proc. ACM Program. Lang."},{"issue":"10","key":"4_CR20","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/2858965.2814297","volume":"50","author":"B Demsky","year":"2015","unstructured":"Demsky, B., Lam, P.: SATCheck: SAT-directed stateless model checking for SC and TSO. ACM SIGPLAN Not. 50(10), 20\u201336 (2015). https:\/\/doi.org\/10.1145\/2858965.2814297","journal-title":"ACM SIGPLAN Not."},{"issue":"POPL","key":"4_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3498711","volume":"6","author":"M Kokologiannakis","year":"2022","unstructured":"Kokologiannakis, M., Marmanis, I., Gladstein, V., Vafeiadis, V.: Truly stateless, optimal dynamic partial order reduction. Proc. ACM Program. Lang. 6(POPL), 1\u201328 (2022). https:\/\/doi.org\/10.1145\/3498711","journal-title":"Proc. ACM Program. Lang."},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-41540-6_1","volume-title":"Computer Aided Verification","author":"M Gario","year":"2016","unstructured":"Gario, M., Cimatti, A., Mattarei, C., Tonetta, S., Rozier, K.Y.: Model checking at scale: automated air traffic control design space exploration. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 3\u201322. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_1"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Bornholt, J., et al.: Using lightweight formal methods to validate a key-value storage node in Amazon S3. In: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles, pp. 836\u2013850 (2021). https:\/\/doi.org\/10.1145\/3477132.3483540","DOI":"10.1145\/3477132.3483540"},{"issue":"12","key":"4_CR24","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1145\/361227.361234","volume":"18","author":"RJ Lipton","year":"1975","unstructured":"Lipton, R.J.: Reduction: a method of proving properties of parallel programs. Commun. ACM 18(12), 717\u2013721 (1975)","journal-title":"Commun. ACM"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Ben-Or, M.: Another advantage of free choice (extended abstract) completely asynchronous agreement protocols. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, pp. 27\u201330 (1983). https:\/\/doi.org\/10.1145\/800221.806707","DOI":"10.1145\/800221.806707"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-009-0084-6","volume":"22","author":"B Charron-Bost","year":"2009","unstructured":"Charron-Bost, B., Schiper, A.: The heard-of model: computing in distributed systems with benign faults. Distrib. Comput. 22, 49\u201371 (2009). https:\/\/doi.org\/10.1007\/s00446-009-0084-6","journal-title":"Distrib. Comput."},{"key":"4_CR27","unstructured":"Liskov, B., Cowling, J.: Viewstamped replication revisited. MIT, Tech. Rep. (2012). MIT-CSAIL-TR-2012-021, Jul 2012"}],"container-title":["Lecture Notes in Computer Science","Verified Software. Theories, Tools and Experiments."],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25803-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T20:21:08Z","timestamp":1675196468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25803-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031258022","9783031258039"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25803-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VSTTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Working Conference on Verified Software: Theories, Tools, and Experiments","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trento","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vstte2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/vstte22.fbk.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}