{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T11:30:03Z","timestamp":1757590203397,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030309411"},{"type":"electronic","value":"9783030309428"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30942-8_5","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T23:03:06Z","timestamp":1569193386000},"page":"45-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mechanically Verifying the Fundamental Liveness Property of the Chord Protocol"],"prefix":"10.1007","author":[{"given":"Jean-Paul","family":"Bodeveix","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Brunel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Chemouil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mamoun","family":"Filali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9781139195881","volume-title":"Modeling in Event-B","author":"JR Abrial","year":"2009","unstructured":"Abrial, J.R.: Modeling in Event-B. Cambridge University Press, Cambridge (2009). \nhttps:\/\/doi.org\/10.1017\/cbo9781139195881"},{"issue":"6","key":"5_CR2","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10009-010-0145-y","volume":"12","author":"JR Abrial","year":"2010","unstructured":"Abrial, J.R., Butler, M., Hallerstede, S., Hoang, T.S., Mehta, F., Voisin, L.: Rodin: an open toolset for modelling and reasoning in Event-B. Int. J. Softw. Tools Technol. Transf. 12(6), 447\u2013466 (2010). \nhttps:\/\/doi.org\/10.1007\/s10009-010-0145-y","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.entcs.2007.01.052","volume":"181","author":"R Bakhshi","year":"2007","unstructured":"Bakhshi, R., Gurov, D.: Verification of peer-to-peer algorithms: a case study. Electron. Notes Theor. Comput. Sci. 181, 35\u201347 (2007). \nhttps:\/\/doi.org\/10.1016\/j.entcs.2007.01.052","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Bodeveix, J.P., Brunel, J., Chemouil, D., Filali, M.: A model in Event-B of the Chord protocol, July 2019. \nhttps:\/\/doi.org\/10.5281\/zenodo.3271455","DOI":"10.5281\/zenodo.3271455"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Brunel, J., Chemouil, D., Tawa, J.: Analyzing the fundamental liveness property of the Chord protocol. In: Formal Methods in Computer-Aided Design, Austin, USA, October 2018. \nhttps:\/\/doi.org\/10.23919\/fmcad.2018.8603001\n\n. \nhttps:\/\/hal.archives-ouvertes.fr\/hal-01862755","DOI":"10.23919\/fmcad.2018.8603001"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Hawblitzel, C., et al.: IronFleet: proving practical distributed systems correct. In: Proceedings of the ACM Symposium on Operating Systems Principles (SOSP), ACM \u2013Association for Computing Machinery, October 2015. \nhttps:\/\/doi.org\/10.1145\/2815400.2815428","DOI":"10.1145\/2815400.2815428"},{"key":"5_CR7","volume-title":"Software Abstractions: Logic, Language, and Analysis","author":"D Jackson","year":"2012","unstructured":"Jackson, D.: Software Abstractions: Logic, Language, and Analysis. MIT Press, Cambridge (2012)"},{"key":"5_CR8","unstructured":"Lamport, L.: Specifying Systems: The TLA$$^+$$ Language and Tools for Hardware and Software Engineers. Addison-Wesley Longman Publishing Co., Inc. (2002)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-30186-8_23","volume-title":"Distributed Computing","author":"X Li","year":"2004","unstructured":"Li, X., Misra, J., Plaxton, C.G.: Active and concurrent topology maintenance. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 320\u2013334. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30186-8_23"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the evolution of peer-to-peer systems. In: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, pp. 233\u2013242. ACM (2002). \nhttps:\/\/doi.org\/10.1145\/571860.571863","DOI":"10.1145\/571860.571863"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Macedo, N., Brunel, J., Chemouil, D., Cunha, A., Kuperberg, D.: Lightweight specification and analysis of dynamic systems with rich configurations. In: Foundations of Software Engineering (2016). \nhttps:\/\/doi.org\/10.1145\/2950290.2950318","DOI":"10.1145\/2950290.2950318"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Marinkovi\u0107, B., Glavan, P., Ognjanovi\u0107, Z.: Proving properties of the Chord protocol using the ASM formalism. Theor. Comput. Sci. 756, 64 \u2013 93 (2019). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2018.10.025\n\n, \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397518306467","DOI":"10.1016\/j.tcs.2018.10.025"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Merz, S., Lu, T., Weidenbach, C.: Towards verification of the pastry protocol using TLA$$^+$$. In: 31st IFIP International Conference on Formal Techniques for Networked and Distributed Systems, vol. 6722 (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-21461-5_16","DOI":"10.1007\/978-3-642-21461-5_16"},{"issue":"POPL","key":"5_CR14","doi-asserted-by":"publisher","first-page":"26:1","DOI":"10.1145\/3158114","volume":"2","author":"O Padon","year":"2018","unstructured":"Padon, O., Hoenicke, J., Losa, G., Podelski, A., Sagiv, M., Shoham, S.: Reducing liveness to safety in first-order logic. PACMPL 2(POPL), 26:1\u201326:33 (2018). \nhttps:\/\/doi.org\/10.1145\/3158114","journal-title":"PACMPL"},{"key":"5_CR15","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, PLDI 2016, Santa Barbara, CA, USA, 13\u201317 June 2016, pp. 614\u2013630 (2016). \nhttps:\/\/doi.org\/10.1145\/2908080.2908118","DOI":"10.1145\/2908080.2908118"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Risson, J., Robinson, K., Moors, T.: Fault tolerant active rings for structured peer-to-peer overlays. In: 2005 The IEEE Conference on Local Computer Networks, 30th Anniversary, pp. 18\u201325. IEEE (2005). \nhttps:\/\/doi.org\/10.1109\/lcn.2005.69","DOI":"10.1109\/lcn.2005.69"},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/964723.383071","volume":"31","author":"I Stoica","year":"2001","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Comput. Commun. Rev. 31(4), 149\u2013160 (2001). \nhttps:\/\/doi.org\/10.1145\/964723.383071","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/tnet.2002.808407","volume":"11","author":"I Stoica","year":"2003","unstructured":"Stoica, I., et al.: Chord: a scalable peer-to-peer lookup protocol for Internet applications. IEEE\/ACM Trans. Netw. (TON) 11(1), 17\u201332 (2003). \nhttps:\/\/doi.org\/10.1109\/tnet.2002.808407","journal-title":"IEEE\/ACM Trans. Netw. (TON)"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Wilcox, J.R., et al.: Verdi: a framework for implementing and formally verifying distributed systems. In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, 15\u201317 June 2015, pp. 357\u2013368 (2015). \nhttps:\/\/doi.org\/10.1145\/2737924.2737958","DOI":"10.1145\/2737924.2737958"},{"key":"5_CR20","unstructured":"Zave, P.: Why the Chord ring-maintenance protocol is not correct. Technical report, AT&T Research (2011)"},{"issue":"2","key":"5_CR21","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/2185376.2185383","volume":"42","author":"P Zave","year":"2012","unstructured":"Zave, P.: Using lightweight modeling to understand Chord. ACM SIGCOMM Comput. Commun. Rev. 42(2), 49\u201357 (2012). \nhttps:\/\/doi.org\/10.1145\/2185376.2185383","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"issue":"2","key":"5_CR22","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00165-014-0302-2","volume":"27","author":"P Zave","year":"2015","unstructured":"Zave, P.: A practical comparison of Alloy and Spin. Formal Aspects Comput. 27(2), 239 (2015). \nhttps:\/\/doi.org\/10.1007\/s00165-014-0302-2","journal-title":"Formal Aspects Comput."},{"issue":"12","key":"5_CR23","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1109\/TSE.2017.2655056","volume":"43","author":"P Zave","year":"2017","unstructured":"Zave, P.: Reasoning about identifier spaces: how to make Chord correct. IEEE Trans. Softw. Eng. 43(12), 1144\u20131156 (2017). \nhttps:\/\/doi.org\/10.1109\/TSE.2017.2655056","journal-title":"IEEE Trans. Softw. Eng."}],"container-title":["Lecture Notes in Computer Science","Formal Methods \u2013 The Next 30 Years"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30942-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T06:07:03Z","timestamp":1588658823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30942-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030309411","9783030309428"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30942-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2019.inesctec.pt\/","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":"129","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":"44","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":"7","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":"34% - 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":"4","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":"5,5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}