{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:44:08Z","timestamp":1755794648401,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031380990"},{"type":"electronic","value":"9783031381003"}],"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-38100-3_13","type":"book-chapter","created":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T22:01:31Z","timestamp":1689112891000},"page":"210-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Implementation of\u00a0a\u00a0Reversible Distributed Calculus"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6346-3043","authenticated-orcid":false,"given":"Cl\u00e9ment","family":"Aubert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Browning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/3127586","volume":"65","author":"M Abadi","year":"2018","unstructured":"Abadi, M., Blanchet, B., Fournet, C.: The applied pi calculus: Mobile values, new names, and secure communication. J. ACM 65(1), 1:1-1:41 (2018). https:\/\/doi.org\/10.1145\/3127586","journal-title":"J. ACM"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.entcs.2007.11.010","volume":"199","author":"R Affeldt","year":"2008","unstructured":"Affeldt, R., Kobayashi, N.: A coq library for verification of concurrent programs. Electron. Notes Theor. Comput. Sci. 199, 17\u201332 (2008). https:\/\/doi.org\/10.1016\/j.entcs.2007.11.010","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-47361-7_1","volume-title":"Reversible Computation: Extending Horizons of Computing","author":"B Aman","year":"2020","unstructured":"Aman, B., et al.: Foundations of reversible computation. In: Ulidowski, I., Lanese, I., Schultz, U.P., Ferreira, C. (eds.) RC 2020. LNCS, vol. 12070, pp. 1\u201340. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-47361-7_1"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Aubert, C.: Replications in reversible concurrent calculi. In: Kutrib, M., Meyer, U. (eds.) RC 2023. LNCS, Springer (2023), to appear","DOI":"10.1007\/978-3-031-38100-3_2"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Aubert, C.: The correctness of concurrencies in (Reversible) concurrent calculi (Jan 2023). https:\/\/hal.science\/hal-03950347, under revision for JLAMP","DOI":"10.1007\/978-3-031-09005-9_10"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Aubert, C., Cristescu, I.: How reversibility can solve traditional questions: the example of hereditary history-preserving bisimulation. In: Konnov, I., Kov\u00e1cs, L. (eds.) CONCUR 2020. LIPIcs, vol. 2017, pp. 13:1\u201313:24. Schloss Dagstuhl (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.13","DOI":"10.4230\/LIPIcs.CONCUR.2020.13"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-030-79837-6_9","volume-title":"Reversible Computation","author":"C Aubert","year":"2021","unstructured":"Aubert, C., Medi\u0107, D.: Explicit identifiers and contexts in reversible concurrent calculus. In: Yamashita, S., Yokoyama, T. (eds.) RC 2021. LNCS, vol. 12805, pp. 144\u2013162. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79837-6_9"},{"key":"13_CR8","unstructured":"Bednarczyk, M.A.: Hereditary history preserving bisimulations or what is the power of the future perfect in program logics. Tech. rep, Instytut Podstaw Informatyki PAN filia w Gda\u0144sku (1991)"},{"issue":"1\u20132","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/3300000004","volume":"1","author":"B Blanchet","year":"2016","unstructured":"Blanchet, B.: Modeling and verifying security protocols with the applied pi calculus and ProVerif. Found. Trends Priv. Secur. 1(1\u20132), 1\u2013135 (2016). https:\/\/doi.org\/10.1561\/3300000004","journal-title":"Found. Trends Priv. Secur."},{"key":"13_CR10","unstructured":"Cox, G.: SimCCSK: simulation of the reversible process calculi CCSK. Master\u2019s thesis, University of Leicester (4 2010). https:\/\/leicester.figshare.com\/ndownloader\/files\/18193256"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-28644-8_19","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V Danos","year":"2004","unstructured":"Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292\u2013307. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_19"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/3-540-44929-9_30","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"J Despeyroux","year":"2000","unstructured":"Despeyroux, J.: A higher-order specification of the $$\\pi $$-calculus. In: van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P.D., Ito, T. (eds.) TCS 2000. LNCS, vol. 1872, pp. 425\u2013439. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44929-9_30"},{"key":"13_CR13","unstructured":"Gillet, J.F., Willame, D.: Calculus of communicating systems: a web based tool in scala. Master\u2019s thesis, Universit\u00e9 de Namur (6 2017). https:\/\/researchportal.unamur.be\/files\/30127909\/GILLET_WILLAME_Memoire.pdf"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BFb0028392","volume-title":"Theorem Proving in Higher Order Logics","author":"D Hirschkoff","year":"1997","unstructured":"Hirschkoff, D.: A full formalisation of $$\\pi $$-calculus theory in the calculus of constructions. In: Gunter, E.L., Felty, A. (eds.) TPHOLs 1997. LNCS, vol. 1275, pp. 153\u2013169. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0028392"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-030-79837-6_8","volume-title":"Reversible Computation","author":"I Lanese","year":"2021","unstructured":"Lanese, I., Phillips, I.: Forward-reverse observational equivalences in CCSK. In: Yamashita, S., Yokoyama, T. (eds.) RC 2021. LNCS, vol. 12805, pp. 126\u2013143. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79837-6_8"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-319-22102-1_19","volume-title":"Interactive Theorem Proving","author":"P Maksimovi\u0107","year":"2015","unstructured":"Maksimovi\u0107, P., Schmitt, A.: HOCore in Coq. In: Urban, C., Zhang, X. (eds.) ITP 2015. LNCS, vol. 9236, pp. 278\u2013293. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22102-1_19"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Martins, F., Lopes, L.M.B., Vasconcelos, V.T.: The impact of linearity information on the performance of tyco. In: Barthe, G., Thiemann, P. (eds.) TIP@MPC 2002. Electron. Notes Theor. Comput. Sci., vol. 75, pp. 41\u201360. Elsevier (2002). https:\/\/doi.org\/10.1016\/S1571-0661(04)80778-3","DOI":"10.1016\/S1571-0661(04)80778-3"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/11690634_17","volume-title":"Foundations of Software Science and Computation Structures","author":"I Phillips","year":"2006","unstructured":"Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FoSSaCS 2006. LNCS, vol. 3921, pp. 246\u2013260. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11690634_17"},{"issue":"4","key":"13_CR19","first-page":"357","volume":"11","author":"A Rabinovich","year":"1988","unstructured":"Rabinovich, A., Trakhtenbrot, B.A.: Behavior structures and nets. Fund. Inform. 11(4), 357\u2013404 (1988)","journal-title":"Fund. Inform."},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Ryan, M.D., Smyth, B.: Applied pi calculus. In: Cortier, V., Kremer, S. (eds.) Formal Models and Techniques for Analyzing Security Protocols, Cryptology and Information Security Series, vol. 5, pp. 112\u2013142. IOS Press (2011). https:\/\/doi.org\/10.3233\/978-1-60750-714-7-112","DOI":"10.3233\/978-1-60750-714-7-112"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"The Coq Development Team: the coq proof assistant (2022). https:\/\/doi.org\/10.5281\/zenodo.5846982","DOI":"10.5281\/zenodo.5846982"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-28830-2_22","volume-title":"Software Language Engineering","author":"PT Wojciechowski","year":"2012","unstructured":"Wojciechowski, P.T.: Typed first-class communication channels and mobility for concurrent scripting languages. In: Sloane, A., A\u00dfmann, U. (eds.) SLE 2011. LNCS, vol. 6940, pp. 378\u2013387. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28830-2_22"}],"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-38100-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,16]],"date-time":"2023-12-16T22:32:34Z","timestamp":1702765954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38100-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031380990","9783031381003"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38100-3_13","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":"12 July 2023","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":"Giessen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/reversible-computation-2023.github.io\/site\/index.html","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":"19","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":"11","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":"3","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":"58% - 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)"}}]}}