{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T04:02:57Z","timestamp":1750564977540,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031970627","type":"print"},{"value":"9783031970634","type":"electronic"}],"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-97063-4_3","type":"book-chapter","created":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T07:42:42Z","timestamp":1750491762000},"page":"27-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Encoding Choice and\u00a0Replication in\u00a0$$\\mathtt{\\textbf{roll}}\\text {-}\\pi $$"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1236-7160","authenticated-orcid":false,"given":"Adam D.","family":"Barwell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6899-9971","authenticated-orcid":false,"given":"Ping","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2057-0495","authenticated-orcid":false,"given":"Martin","family":"Vassor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3925-8557","authenticated-orcid":false,"given":"Nobuko","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,22]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Barbanera, F., Lanese, I., de\u2019Liguoro, U.: A theory of retractable and speculative contracts. Sci. Comput. Programm. 167, 25\u201350 (2018). https:\/\/doi.org\/10.1016\/j.scico.2018.06.005, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167642318302636","DOI":"10.1016\/j.scico.2018.06.005"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Castellani, I., Dezani-Ciancaglini, M., Giannini, P.: Concurrent reversible sessions. In: Meyer, R., Nestmann, U. (eds.) 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a085, pp. 30:1\u201330:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2017.30, http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/7787, ISSN: 1868-8969","DOI":"10.4230\/LIPIcs.CONCUR.2017.30"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/1328897.1328472","volume":"43","author":"K Honda","year":"2008","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. ACM SIGPLAN Notices 43(1), 273\u2013284 (2008). https:\/\/doi.org\/10.1145\/1328897.1328472","journal-title":"ACM SIGPLAN Notices"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Lagaillardie, N., Neykova, R., Yoshida, N.: Stay safe under panic: Affine rust programming with multiparty session types. In: Ali, K., Vitek, J. (eds.) 36th European Conference on Object-Oriented Programming (ECOOP 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0222, pp. 4:1\u20134:29. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2022.4, https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2022\/16232, ISSN: 1868-8969","DOI":"10.4230\/LIPIcs.ECOOP.2022.4"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Lanese, I., Mezzina, C.A., Schmitt, A., Stefani, J.-B.: Controlling Reversibility in Higher-Order Pi. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 297\u2013311. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23217-6_20","DOI":"10.1007\/978-3-642-23217-6_20"},{"key":"3_CR6","unstructured":"Mezzina, C.A.: Reversing execution in higher-order pi. https:\/\/tel.archives-ouvertes.fr\/tel-00683964"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Mezzina, C.A., Tiezzi, F., Yoshida, N.: Checkpoint-based rollback recovery in session programming. Logical Methods Comput. Sci. 21(1), January 2025. https:\/\/doi.org\/10.46298\/lmcs-21(1:2)2025. https:\/\/lmcs.episciences.org\/15049","DOI":"10.46298\/lmcs-21(1:2)2025"},{"key":"3_CR8","unstructured":"Milner, R.R.: Communicating and mobile systems: the pi-calculus. Cambridge [England]; New York: Cambridge University Press (1999). http:\/\/archive.org\/details\/communicatingmob00robi"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90009-5","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. II. Inf. Comput. 100(1), 41\u201377 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90009-5","journal-title":"II. Inf. Comput."},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10586-013-0277-4","volume":"17","author":"KS Perumalla","year":"2013","unstructured":"Perumalla, K.S., Park, A.J.: Reverse computation for rollback-based fault tolerance in large parallel systems. Clust. Comput. 17(2), 303\u2013313 (2013). https:\/\/doi.org\/10.1007\/s10586-013-0277-4","journal-title":"Clust. Comput."},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Peters, K., Nestmann, U., Wagner, C.: Fault-tolerant multiparty session types. In: Mousavi, M.R., Philippou, A. (eds.) Formal Techniques for Distributed Objects, Components, and Systems. LNCS, pp. 93\u2013113. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-08679-3_7","DOI":"10.1007\/978-3-031-08679-3_7"},{"key":"3_CR12","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"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Walker, D.: The Pi-Calculus - a theory of mobile processes. Cambridge University Press (2001)","DOI":"10.1017\/9781316134924"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Vassor, M., Stefani, J.B.: Checkpoint\/rollback vs causally-consistent reversibility. In: Kari, J., Ulidowski, I. (eds.) Reversible Computation, pp. 286\u2013303. LNCS. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_20","DOI":"10.1007\/978-3-319-99498-7_20"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Vidal, G.: From reversible computation to\u00a0checkpoint-based rollback recovery for\u00a0message-passing concurrent programs. In: C\u00e1mara, J., Jongmans, S.S. (eds.) Formal Aspects of Component Software, pp. 103\u2013123. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-52183-6_6","DOI":"10.1007\/978-3-031-52183-6_6"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97063-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T07:42:44Z","timestamp":1750491764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97063-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031970627","9783031970634"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97063-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reversible Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Odense","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"3 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/reversible-computation-2025.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}