{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T22:41:58Z","timestamp":1763764918920,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031167669"},{"type":"electronic","value":"9783031167676"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16767-6_6","type":"book-chapter","created":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T16:02:40Z","timestamp":1662825760000},"page":"103-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["From Infinity to\u00a0Choreographies"],"prefix":"10.1007","author":[{"given":"Bj\u00f8rn Angel","family":"Kj\u00e6r","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7866-7484","authenticated-orcid":false,"given":"Lu\u00eds","family":"Cruz-Filipe","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4666-901X","authenticated-orcid":false,"given":"Fabrizio","family":"Montesi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,11]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00446-017-0295-1","volume":"31","author":"M Carbone","year":"2017","unstructured":"Carbone, M., Montesi, F., Sch\u00fcrmann, C.: Choreographies, logically. Distrib. Comput. 31(1), 51\u201367 (2017). https:\/\/doi.org\/10.1007\/s00446-017-0295-1","journal-title":"Distrib. Comput."},{"key":"6_CR2","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":"6_CR3","unstructured":"Cruz-Filipe, L., Larsen, K.S., Montesi, F., Safina, L.: Implementing choreography extraction. CoRR abs\/2205.02636 (2022). https:\/\/arxiv.org\/abs\/2205.02636. Submitted for publication"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-319-60225-7_7","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"L Cruz-Filipe","year":"2017","unstructured":"Cruz-Filipe, L., Montesi, F.: Procedural choreographic programming. In: Bouajjani, A., Silva, A. (eds.) FORTE 2017. LNCS, vol. 10321, pp. 92\u2013107. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60225-7_7"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2019.07.005","volume":"802","author":"L Cruz-Filipe","year":"2020","unstructured":"Cruz-Filipe, L., Montesi, F.: A core model for choreographic programming. Theor. Comput. Sci. 802, 38\u201366 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.07.005","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"9","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 (2016). https:\/\/doi.org\/10.1145\/2827695","journal-title":"J. ACM"},{"key":"6_CR7","unstructured":"International Telecommunication Union: Recommendation Z.120: Message sequence chart (1996)"},{"key":"6_CR8","unstructured":"Kj\u00e6r, B.A.: Implementing choreography extraction in Java. Bachelor thesis, University of Southern Denmark (2020)"},{"key":"6_CR9","unstructured":"Kj\u00e6r, B.A., Cruz-Filipe, L., Montesi, F.: From infinity to choreographies: extraction for unbounded systems. CoRR abs\/2207.08884 (2022). https:\/\/arxiv.org\/abs\/2207.08884. Technical report"},{"key":"6_CR10","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.6554763","author":"BA Kj\u00e6r","year":"2022","unstructured":"Kj\u00e6r, B.A.: Choreographic extractor (2022). https:\/\/doi.org\/10.5281\/zenodo.6554763","journal-title":"Choreographic extractor"},{"key":"6_CR11","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":"6_CR12","doi-asserted-by":"publisher","unstructured":"Lange, J., Tuosto, E., Yoshida, N.: From communicating machines to graphical choreographies. In: Rajamani, S.K., Walker, D. (eds.) Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, 15\u201317 January 2015, pp. 221\u2013232. ACM (2015). https:\/\/doi.org\/10.1145\/2676726.2676964","DOI":"10.1145\/2676726.2676964"},{"key":"6_CR13","unstructured":"Montesi, F.: Choreographic programming. Ph.D. Thesis, IT University of Copenhagen (2013). https:\/\/www.fabriziomontesi.com\/files\/choreographic-programming.pdf"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Montesi, F.: Introduction to Choreographies. Cambridge University Press (2022). Accepted for publication","DOI":"10.1017\/9781108981491"},{"key":"6_CR15","unstructured":"Object Management Group: Business process model and notation (2011). http:\/\/www.omg.org\/spec\/BPMN\/2.0\/"},{"key":"6_CR16","unstructured":"Object Management Group: Unified modelling language, version 2.5.1 (2017)"},{"key":"6_CR17","unstructured":"Safina, L.: Formal methods and patterns for microservices. Ph.D. thesis, University of Southen Denmark (2019)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-59293-8_194","volume-title":"TAPSOFT \u201995: Theory and Practice of Software Development","author":"D Sangiorgi","year":"1995","unstructured":"Sangiorgi, D.: $$\\pi $$I: a symmetric calculus based on internal mobility. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds.) CAAP 1995. LNCS, vol. 915, pp. 172\u2013186. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59293-8_194"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Sangiorgi, D.: Introduction to Bisimulation and Coinduction. Cambridge University Press (2011). https:\/\/doi.org\/10.1017\/CBO9780511777110","DOI":"10.1017\/CBO9780511777110"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16767-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T20:29:58Z","timestamp":1701030598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16767-6_6"}},"subtitle":["Extraction for Unbounded Systems"],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031167669","9783031167676"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16767-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tbilisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","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":"21 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lopstr2022.webs.upv.es","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":"17","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":"8","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":"47% - 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","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":"3","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)"}}]}}