{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:31:48Z","timestamp":1757626308588,"version":"3.44.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031954962"},{"type":"electronic","value":"9783031954979"}],"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-95497-9_10","type":"book-chapter","created":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T13:15:43Z","timestamp":1749906943000},"page":"173-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Choreographies for\u00a0Program Understanding"],"prefix":"10.1007","author":[{"given":"Gabriele","family":"Genovese","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2527-9995","authenticated-orcid":false,"given":"Ivan","family":"Lanese","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1563-6581","authenticated-orcid":false,"given":"Cinzia","family":"Di Giusto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7032-3281","authenticated-orcid":false,"given":"Emilio","family":"Tuosto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1857-6951","authenticated-orcid":false,"given":"Germ\u00e1n","family":"Vidal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,11]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2004.09.034","volume":"331","author":"R Alur","year":"2005","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of MSC graphs. Theor. Comput. Sci. 331(1), 97\u2013114 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/MS.2014.131","volume":"32","author":"M Autili","year":"2015","unstructured":"Autili, M., Inverardi, P., Tivoli, M.: Automated synthesis of service choreographies. IEEE Softw. 32(1), 50\u201357 (2015)","journal-title":"IEEE Softw."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-030-50029-0_6","volume-title":"Coordination Models and Languages","author":"F Barbanera","year":"2020","unstructured":"Barbanera, F., Lanese, I., Tuosto, E.: Choreography automata. In: Bliudze, S., Bocchi, L. (eds.) COORDINATION 2020. LNCS, vol. 12134, pp. 86\u2013106. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50029-0_6"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bartoletti, M., Tuosto, E., Zunino, R.: Contracts in distributed systems. In: Silva, A., Bliudze, S., Bruni, R., Carbone, M., (eds.) ICE, vol. 59, 130\u2013147 (2011)","DOI":"10.4204\/EPTCS.59.11"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bartoletti, M., Tuosto, E., Zunino, R.: On the realizability of contracts in dishonest systems. In: Sirjani, M., (ed.) COORDINATION, pp. 245\u2013260 (2012)","DOI":"10.1007\/978-3-642-30829-1_17"},{"key":"10_CR6","unstructured":"Bon\u00e9r, J.: Reactive Microsystems - The Evolution Of Microservices At Scale. O\u2019Reilly, Sebastopol (2018)"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323\u2013342 (1983)","journal-title":"J. ACM"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1017\/S0960129509007658","volume":"19","author":"M Bravetti","year":"2009","unstructured":"Bravetti, M., Zavattaro, G.: A theory of contracts for strong service compliance. Math. Struct. Comput. Sci. 19(3), 601\u2013638 (2009)","journal-title":"Math. Struct. Comput. Sci."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00446-017-0295-1","volume":"31","author":"M Carbone","year":"2018","unstructured":"Carbone, M., Montesi, F., Sch\u00fcrmann, C.: Choreographies, logically. Distri. Comput. 31, 51\u201367 (2018)","journal-title":"Distri. Comput."},{"key":"10_CR10","unstructured":"Chorer github repository. https:\/\/github.com\/gabrielegenovese\/chorer"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-662-54458-7_25","volume-title":"Foundations of Software Science and Computation Structures","author":"L Cruz-Filipe","year":"2017","unstructured":"Cruz-Filipe, L., Larsen, K.S., Montesi, F.: The paths to choreography extraction. In: Esparza, J., Murawski, A.S. (eds.) FoSSaCS 2017. LNCS, vol. 10203, pp. 424\u2013440. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54458-7_25"},{"key":"10_CR12","unstructured":"Two simple examples. Dining example and Account example, https:\/\/github.com\/gabrielegenovese\/chorer\/tree\/master\/examples\/dining. https:\/\/github.com\/gabrielegenovese\/chorer\/tree\/master\/examples\/account"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-030-50029-0_7","volume-title":"Coordination Models and Languages","author":"L Frittelli","year":"2020","unstructured":"Frittelli, L., Maldonado, F., Melgratti, H., Tuosto, E.: A choreography-driven approach to\u00a0APIs: the OpenDXL case study. In: Bliudze, S., Bocchi, L. (eds.) COORDINATION 2020. LNCS, vol. 12134, pp. 107\u2013124. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50029-0_7"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: Model checking for programming languages using verisoft. In: POPL, pp. 174\u2013186 (1997)","DOI":"10.1145\/263699.263717"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/2827695","volume":"63","author":"K Honda","year":"2016","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. J. ACM 63(1), 9:1-9:67 (2016)","journal-title":"J. ACM"},{"issue":"1","key":"10_CR16","first-page":"3:1","volume":"49","author":"H H\u00fcttel","year":"2016","unstructured":"H\u00fcttel, H., et al.: Foundations of session types and behavioural contracts. ACM Comput. Surv. 49(1), 3:1-3:36 (2016)","journal-title":"ACM Comput. Surv."},{"key":"10_CR17","unstructured":"Kavantzas, N., Burdett, D., Ritzinger, G., Fletcher, T., Lafon, Y., Barreto, C.: Web services choreography description language version 1.0. Technical report, W3C (2005). http:\/\/www.w3.org\/TR\/ws-cdl-10\/"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Lange, J., Scalas, A.: Choreography synthesis as contract agreement. In: Proceedings 6th Interaction and Concurrency Experience, ICE 2013, pp. 52\u201367 (2013)","DOI":"10.4204\/EPTCS.131.6"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-32940-1_17","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"J Lange","year":"2012","unstructured":"Lange, J., Tuosto, E.: Synthesising choreographies from local session types. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 225\u2013239. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32940-1_17"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Lange, J., Tuosto, E., Yoshida, N.: From communicating machines to graphical choreographies. In: Rajamani, S.K., Walker, D., (eds.) POPL, pp. 221\u2013232. ACM (2015)","DOI":"10.1145\/2676726.2676964"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Lange, J., Tuosto, E., Yoshida, N.: From communicating machines to graphical choreographies. In: POPL15, pp. 221\u2013232 (2015)","DOI":"10.1145\/2676726.2676964"},{"issue":"1\u20133","key":"10_CR22","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.tcs.2003.08.002","volume":"309","author":"M Lohrey","year":"2003","unstructured":"Lohrey, M.: Realizability of high-level message sequence charts: closing the gaps. Theor. Comput. Sci. 309(1\u20133), 529\u2013554 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR23","unstructured":"Milner, R.: Communicating and Mobile Systems: the $$\\pi $$-calculus. Cambridge University Press, Cambridge (1999)"},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I and II. Inf. Comp. 100(1), 1\u201340 (1992)","journal-title":"Inf. Comp."},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-642-00590-9_23","volume-title":"Programming Languages and Systems","author":"D Mostrous","year":"2009","unstructured":"Mostrous, D., Yoshida, N., Honda, K.: Global principal typing in partially commutative asynchronous sessions. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 316\u2013332. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00590-9_23"},{"key":"10_CR26","unstructured":"OMG. Business Process Model and Notation (BPMN), Version 2.0, January 2011. https:\/\/www.omg.org\/spec\/BPMN"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Walker, D.: The $$\\pi $$-Calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2002)","DOI":"10.1017\/9781316134924"},{"key":"10_CR28","unstructured":"Stutz, F.: Asynchronous multiparty session type implementability is decidable - lessons learned from message sequence charts. In: Ali, K., Salvaneschi, G., (eds.) 37th European Conference on Object-Oriented Programming, ECOOP 2023, July 17-21, 2023, Seattle, Washington, United States, vol. 263, LIPIcs, pp. 32:1\u201332:31. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"10_CR29","unstructured":"The Graphviz Authors. Dot format. https:\/\/graphviz.org\/doc\/info\/lang.html"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95497-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:43:38Z","timestamp":1757454218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95497-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031954962","9783031954979"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95497-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"11 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"16 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}