{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:14:53Z","timestamp":1762460093731,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031172434"},{"type":"electronic","value":"9783031172441"}],"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-17244-1_7","type":"book-chapter","created":{"date-parts":[[2022,10,9]],"date-time":"2022-10-09T19:33:23Z","timestamp":1665344003000},"page":"106-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Generation of\u00a0a\u00a0Reversible Semantics for\u00a0Erlang in\u00a0Maude"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3002-0697","authenticated-orcid":false,"given":"Giovanni","family":"Fabbretti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2527-9995","authenticated-orcid":false,"given":"Ivan","family":"Lanese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1373-7602","authenticated-orcid":false,"given":"Jean-Bernard","family":"Stefani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,10]]},"reference":[{"key":"7_CR1","unstructured":"Carlsson, R.: An introduction to core erlang. In: Erlang Workshop (2001)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Cristescu, I., Krivine, J., Varacca, D.: A compositional semantics for the reversible $$\\pi $$-calculus. In: LICS, pp. 388\u2013397 (2013)","DOI":"10.1109\/LICS.2013.45"},{"key":"7_CR3","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"},{"issue":"3","key":"7_CR4","first-page":"31","volume":"180","author":"V Danos","year":"2007","unstructured":"Danos, V., Krivine, J.: Formal molecular biology done in CCS-R. LNCS 180(3), 31\u201349 (2007)","journal-title":"LNCS"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-030-79837-6_5","volume-title":"Reversible Computation","author":"G Fabbretti","year":"2021","unstructured":"Fabbretti, G., Lanese, I., Stefani, J.-B.: Causal-consistent debugging of distributed erlang programs. In: Yamashita, S., Yokoyama, T. (eds.) RC 2021. LNCS, vol. 12805, pp. 79\u201395. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79837-6_5"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Fabbretti, G., Lanese, I., Stefani, JB.: Generation of a reversible semantics for Erlang in Maude. Research Report RR-9468, Inria (2022)","DOI":"10.1007\/978-3-031-17244-1_7"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-54804-8_26","volume-title":"Fundamental Approaches to Software Engineering","author":"E Giachino","year":"2014","unstructured":"Giachino, E., Lanese, I., Mezzina, C.A.: Causal-consistent reversible debugging. In: Gnesi, S., Rensink, A. (eds.) FASE 2014. LNCS, vol. 8411, pp. 370\u2013384. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54804-8_26"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.jlamp.2016.09.003","volume":"88","author":"E Giachino","year":"2017","unstructured":"Giachino, E., Lanese, I., Mezzina, C.A., Tiezzi, F.: Causal-consistent rollback in a tuple-based language. J. Log. Algebraic Methods Program. 88, 99\u2013120 (2017)","journal-title":"J. Log. Algebraic Methods Program."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-030-67438-0_9","volume-title":"Practical Aspects of Declarative Languages","author":"JJ Gonz\u00e1lez-Abril","year":"2021","unstructured":"Gonz\u00e1lez-Abril, J.J., Vidal, G.: Causal-consistent reversible debugging: improving CauDEr. In: Morales, J.F., Orchard, D. (eds.) PADL 2021. LNCS, vol. 12548, pp. 145\u2013160. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67438-0_9"},{"key":"7_CR10","unstructured":"Hewitt, C., Bishop, P., Steiger, R.: A universal modular actor formalism for artificial intelligence. In: IJCAI 1973 (1973)"},{"key":"7_CR11","unstructured":"K\u0151szegi, J.: KErl: Executable semantics for erlang. In: CEUR Workshop Proceedings, vol. 2046, pp. 144\u2013166 (2018)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-031-09005-9_13","volume-title":"Reversible Computation","author":"P Lami","year":"2022","unstructured":"Lami, P., Lanese, I., Stefani, J., Coen, C.S., Fabbretti, G.: Reversibility in erlang: imperative constructs. In: Mezzina, C.A., Podlaski, K. (eds.) RC 2022. LNCS, vol. 13354, pp. 187\u2013203. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09005-9_13"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-319-99498-7_2","volume-title":"Reversible Computation","author":"I Lanese","year":"2018","unstructured":"Lanese, I.: From reversible semantics to reversible debugging. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 34\u201346. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_2"},{"key":"7_CR14","unstructured":"Lanese, I., Medic, D.: A general approach to derive uncontrolled reversible semantics. In: CONCUR, vol. 171, pp. 33:1\u201333:24 (2020)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-23217-6_20","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"I Lanese","year":"2011","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"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-36315-3_19","volume-title":"Reversible Computation","author":"I Lanese","year":"2013","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.-B.: Controlled reversibility and compensations. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 233\u2013240. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36315-3_19"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2016.02.019","volume":"625","author":"I Lanese","year":"2016","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.: Reversibility in the higher-order $$\\pi $$-calculus. Theor. Comput. Sci. 625, 25\u201384 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR18","unstructured":"Lanese, I., Nishida, N., Palacios, A., Vidal, G.: CauDEr website (2018). https:\/\/github.com\/mistupv\/cauder-v2"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.jlamp.2018.06.004","volume":"100","author":"I Lanese","year":"2018","unstructured":"Lanese, I., Nishida, N., Palacios, A., Vidal, G.: A theory of reversibility for Erlang. J. Log. Algebraic Methods Program. 100, 71\u201397 (2018)","journal-title":"J. Log. Algebraic Methods Program."},{"issue":"1","key":"7_CR20","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/MITP.2021.3117920","volume":"24","author":"I Lanese","year":"2022","unstructured":"Lanese, I., Schultz, U.P., Ulidowski, I.: Reversible computing in debugging of Erlang programs. IT Prof. 24(1), 74\u201380 (2022)","journal-title":"IT Prof."},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Laursen, J.S., Schultz, U.P., Ellekilde, L.-P.: Automatic error recovery in robot assembly operations using reverse execution. In: IROS, pp. 1785\u20131792 (2015)","DOI":"10.1109\/IROS.2015.7353609"},{"key":"7_CR22","unstructured":"All about maude (2007)"},{"key":"7_CR23","unstructured":"Melgratti, H.C., Mezzina, C.A., Ulidowski, I.: Reversing place transition nets. Log. Methods Comput. Sci. 16(4) (2020)"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-61604-7_64","volume-title":"CONCUR \u201996: Concurrency Theory","author":"J Meseguer","year":"1996","unstructured":"Meseguer, J.: Rewriting logic as a semantic framework for concurrency: a progress report. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 331\u2013372. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61604-7_64"},{"issue":"4","key":"7_CR25","first-page":"147","volume":"176","author":"M Neuh\u00e4u\u00dfer","year":"2007","unstructured":"Neuh\u00e4u\u00dfer, M., Noll, T.: Abstraction and model checking of Core Erlang programs in Maude. ENTCS 176(4), 147\u2013163 (2007)","journal-title":"ENTCS"},{"issue":"2","key":"7_CR26","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10586-013-0277-4","volume":"17","author":"KS Perumalla","year":"2014","unstructured":"Perumalla, K.S., Park, A.J.: Reverse computation for rollback-based fault tolerance in large parallel systems: evaluating the potential gains and systems effects. Clust. Comput. 17(2), 303\u2013313 (2014)","journal-title":"Clust. Comput."},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-99498-7_6","volume-title":"Reversible Computation","author":"A Philippou","year":"2018","unstructured":"Philippou, A., Psara, K.: Reversible computation in petri nets. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 84\u2013101. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_6"},{"issue":"1\u20132","key":"7_CR28","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jlap.2006.11.002","volume":"73","author":"ICC Phillips","year":"2007","unstructured":"Phillips, I.C.C., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebraic Methods Program. 73(1\u20132), 70\u201396 (2007)","journal-title":"J. Log. Algebraic Methods Program."},{"key":"7_CR29","unstructured":"Automatic generation of reversible semantics in Maude. https:\/\/bit.ly\/3RQgGsu"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Svensson, H., Fredlund, L., Earle, C.B.: A unified semantics for future Erlang. In: ACM SIGPLAN Workshop on Erlang, pp. 23\u201332. ACM (2010)","DOI":"10.1145\/1863509.1863514"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17244-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T12:24:22Z","timestamp":1674908662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17244-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031172434","9783031172441"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17244-1_7","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":"10 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICFEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Engineering Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfem2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/maude.ucm.es\/ICFEM22\/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":"61","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":"23","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":"38% - 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)"}},{"value":"3 invited papers (two papers and one abstract)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}