{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T13:50:31Z","timestamp":1780494631412,"version":"3.54.1"},"publisher-location":"Cham","reference-count":97,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031380990","type":"print"},{"value":"9783031381003","type":"electronic"}],"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_3","type":"book-chapter","created":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T22:01:31Z","timestamp":1689112891000},"page":"24-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Towards a\u00a0Taxonomy for\u00a0Reversible Computation Approaches"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6990-3935","authenticated-orcid":false,"given":"Robert","family":"Gl\u00fcck","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2527-9995","authenticated-orcid":false,"given":"Ivan","family":"Lanese","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1556-2623","authenticated-orcid":false,"given":"Claudio Antares","family":"Mezzina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8790-101X","authenticated-orcid":false,"given":"Jaros\u0142aw Adam","family":"Miszczak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5013-5876","authenticated-orcid":false,"given":"Iain","family":"Phillips","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3834-2036","authenticated-orcid":false,"given":"Irek","family":"Ulidowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1857-6951","authenticated-orcid":false,"given":"Germ\u00e1n","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.tcs.2005.07.002","volume":"347","author":"S Abramsky","year":"2005","unstructured":"Abramsky, S.: A structural approach to reversible computation. Theor. Comput. Sci. 347(3), 441\u2013464 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-21254-3_8","volume-title":"Language and Automata Theory and Applications","author":"HB Axelsen","year":"2011","unstructured":"Axelsen, H.B., Gl\u00fcck, R.: A simple and efficient universal reversible Turing machine. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 117\u2013128. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21254-3_8"},{"issue":"5","key":"3_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00236-015-0253-y","volume":"53","author":"HB Axelsen","year":"2016","unstructured":"Axelsen, H.B., Gl\u00fcck, R.: On reversible Turing machines and their function universality. Acta Informatica 53(5), 509\u2013543 (2016). https:\/\/doi.org\/10.1007\/s00236-015-0253-y","journal-title":"Acta Informatica"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-74510-5_9","volume-title":"Computer Science \u2013 Theory and Applications","author":"HB Axelsen","year":"2007","unstructured":"Axelsen, H.B., Gl\u00fcck, R., Yokoyama, T.: Reversible machine code and its abstract processor architecture. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds.) CSR 2007. LNCS, vol. 4649, pp. 56\u201369. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74510-5_9"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Barbanera, F., Lanese, I., de\u2019Liguoro, U.: A theory of retractable and speculative contracts. Sci. Comput. Program. 167, 25\u201350 (2018)","DOI":"10.1016\/j.scico.2018.06.005"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Barylska, K., Koutny, M., Mikulski, \u0141., Pia\u0327tkowski, M.: Reversible computation vs. reversibility in Petri nets. Sci. Comput. Program. 151, 48\u201360 (2018)","DOI":"10.1016\/j.scico.2017.10.008"},{"key":"3_CR7","unstructured":"Behrmann, J., Vicol, P., Wang, K.-C., Grosse, R.B., Jacobsen, J.-H.: Understanding and mitigating exploding inverses in invertible neural networks. In: AISTATS 2021, volume 130 of Proceedings of Machine Learning Research, pp. 1792\u20131800. PMLR (2021)"},{"issue":"6","key":"3_CR8","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"CH Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-58043-3_17","volume-title":"A Decade of Concurrency Reflections and Perspectives","author":"JA Bergstra","year":"1994","unstructured":"Bergstra, J.A., Ponse, A., van Wamel, J.J.: Process algebra with backtracking. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol. 803, pp. 46\u201391. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58043-3_17"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-030-50086-3_2","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"M Bernardo","year":"2020","unstructured":"Bernardo, M., Mezzina, C.A.: Towards bridging time and causal reversibility. In: Gotsman, A., Sokolova, A. (eds.) FORTE 2020. LNCS, vol. 12136, pp. 22\u201338. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50086-3_2"},{"key":"3_CR11","volume-title":"Principles of Transaction Processing","author":"AP Bernstein","year":"2009","unstructured":"Bernstein, A.P., Newcomer, E.: Principles of Transaction Processing, 2nd edn. Morgan Kaufmann Publishers Inc., Burlington (2009)","edition":"2"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Bocchi, L., Lanese, I., Mezzina, C.A., Yuen, S.: The reversible temporal process language. In: Mousavi, M.R., Philippou, A. (eds.) FORTE 2022. LNCS, vol. 13273, pp. 31\u201349. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08679-3_3","DOI":"10.1007\/978-3-031-08679-3_3"},{"issue":"7","key":"3_CR13","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1002\/spe.4380170703","volume":"17","author":"JS Briggs","year":"1987","unstructured":"Briggs, J.S.: Generating reversible programs. Softw. Pract. Exper. 17(7), 439\u2013453 (1987)","journal-title":"Softw. Pract. Exper."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Bruni, R., Melgratti, H.C., Montanari, U.: Theoretical foundations for compensations in flow composition languages. In: POPL 2005, pp. 209\u2013220. ACM (2005)","DOI":"10.1145\/1047659.1040323"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-00945-7_6","volume-title":"Trustworthy Global Computing","author":"L Caires","year":"2009","unstructured":"Caires, L., Ferreira, C., Vieira, H.: A process calculus analysis of compensations. In: Kaklamanis, C., Nielson, F. (eds.) TGC 2008. LNCS, vol. 5474, pp. 87\u2013103. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00945-7_6"},{"issue":"2","key":"3_CR16","first-page":"175","volume":"21","author":"L Cardelli","year":"2011","unstructured":"Cardelli, L., Laneve, C.: Reversibility in massive concurrent systems. Sci. Ann. Comput. Sci. 21(2), 175\u2013198 (2011)","journal-title":"Sci. Ann. Comput. Sci."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Castellani, I., Dezani-Ciancaglini, M., Giannini, P.: Reversible sessions with flexible choices. Acta Inform. 56(7\u20138), 553\u2013583 (2019)","DOI":"10.1007\/s00236-019-00332-y"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Cristescu, I., Krivine, J., Varacca, D.: A compositional semantics for the reversible $$\\pi $$-calculus. In: LICS 2013, pp. 388\u2013397. IEEE Computer Society (2013)","DOI":"10.1109\/LICS.2013.45"},{"key":"3_CR19","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":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11539452_31","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"V Danos","year":"2005","unstructured":"Danos, V., Krivine, J.: Transactions in RCCS. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 398\u2013412. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11539452_31"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Davis, M.G., Smith, E., Tudor, A., Sen, K., Siddiqi, I., Iancu, C.: Towards optimal topology aware quantum circuit synthesis. In: QCE 2020, pp. 223\u2013234. IEEE (2020)","DOI":"10.1109\/QCE49297.2020.00036"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"De Vos, A.: Reversible Computing: Fundamentals, Quantum Computing, and Applications. Wiley, Hoboken (2010)","DOI":"10.1002\/9783527633999"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"De Vos, A., De Baerdemacker, S., Van Rentergem, Y., Synthesis of quantum circuits vs. synthesis of classical reversible circuits. In: Synthesis Lectures on Digital Circuits and Systems. Morgan & Claypool Publishers (2018)","DOI":"10.1007\/978-3-031-79895-5"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. Lond. A. Math. Phys. Sci. 400(1818), 97\u2013117 (1985)","DOI":"10.1098\/rspa.1985.0070"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for Petri nets. BRICS Rep. Ser. 1(8), 1994","DOI":"10.7146\/brics.v1i8.21662"},{"issue":"6","key":"3_CR26","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/BF01886518","volume":"16","author":"PR Feynman","year":"1986","unstructured":"Feynman, P.R.: Quantum mechanical computers. Found. Phys. 16(6), 507\u2013531 (1986)","journal-title":"Found. Phys."},{"key":"3_CR27","unstructured":"Frank, M.P.: Reversibility for efficient computing. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, USA (1999)"},{"issue":"3\u20134","key":"3_CR28","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01857727","volume":"21","author":"E Fredkin","year":"1982","unstructured":"Fredkin, E., Toffoli, T.: Quantum mechanical computers. Int. J. Theor. Phys. 21(3\u20134), 219\u2013253 (1982)","journal-title":"Int. J. Theor. Phys."},{"key":"3_CR29","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"},{"issue":"3","key":"3_CR30","first-page":"108","volume":"33","author":"R Gl\u00fcck","year":"2016","unstructured":"Gl\u00fcck, R., Yokoyama, T.: A linear-time self-interpreter of a reversible imperative language. Comput. Softw. 33(3), 108\u2013128 (2016)","journal-title":"Comput. Softw."},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R., Yokoyama, T.: A minimalist\u2019s reversible while language. IEICE Trans. Inf. Syst. E100-D(5), 1026\u20131034 (2017)","DOI":"10.1587\/transinf.2016EDP7274"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R., Yokoyama, T.: Reversible computing from a programming language perspective. Theor. Comput. Sci. 953, Article 113429 (2023)","DOI":"10.1016\/j.tcs.2022.06.010"},{"key":"3_CR33","unstructured":"Gomez, A.N., Ren, M., Urtasun, R., Grosse, R.B.: The reversible residual network: backpropagation without storing activations. In: Advances in Neural Information Processing Systems. NIPS 2017, vol. 30, pp. 2214\u20132224. Curran Associates Inc. (2017)"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Graversen, E., Phillips, I.C.C., Yoshida, N.: Event structure semantics of (controlled) reversible CCS. J. Log. Algebraic Methods Program. 121, 100686 (2021)","DOI":"10.1016\/j.jlamp.2021.100686"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-59936-6_5","volume-title":"Reversible Computation","author":"T Haulund","year":"2017","unstructured":"Haulund, T., Mogensen, T.\u00c6., Gl\u00fcck, R.: Implementing reversible object-oriented language features on reversible machines. In: Phillips, I., Rahaman, H. (eds.) RC 2017. LNCS, vol. 10301, pp. 66\u201373. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59936-6_5"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-030-79837-6_6","volume-title":"Reversible Computation","author":"L Hay-Schmidt","year":"2021","unstructured":"Hay-Schmidt, L., Gl\u00fcck, R., Cservenka, M.H., Haulund, T.: Towards a unified language architecture for reversible object-oriented programming. In: Yamashita, S., Yokoyama, T. (eds.) RC 2021. LNCS, vol. 12805, pp. 96\u2013106. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79837-6_6"},{"key":"3_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2022.102873","volume":"223","author":"J Hoey","year":"2022","unstructured":"Hoey, J., Ulidowski, I.: Reversing an imperative concurrent programming language. Sci. Comput. Program. 223, 102873 (2022)","journal-title":"Sci. Comput. Program."},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-319-99498-7_21","volume-title":"Reversible Computation","author":"PAH Jacobsen","year":"2018","unstructured":"Jacobsen, P.A.H., Kaarsgaard, R., Thomsen, M.K.: $$\\sf CoreFun$$: a typed functional reversible core language. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 304\u2013321. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_21"},{"key":"3_CR39","unstructured":"Jacobson, J.: A formalization of DARCs patch theory using inverse semigroups. Technical report, UCLA (2009)"},{"issue":"3","key":"3_CR40","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s00354-018-0034-6","volume":"36","author":"J Kari","year":"2018","unstructured":"Kari, J.: Reversible cellular automata: from fundamental classical results to recent developments. New Gener. Comput. 36(3), 145\u2013172 (2018)","journal-title":"New Gener. Comput."},{"key":"3_CR41","unstructured":"Kelly, F.P.: Reversibility and Stochastic Networks. Wiley, Hoboken (1979)"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Knill, E.: Conventions for quantum pseudocode. Technical report LAUR-96-2724, Los Alamos National Lab (1996)","DOI":"10.2172\/366453"},{"key":"3_CR43","unstructured":"Kristensen, J.T., Kaarsgaard, R., Thomsen, M.K.: Jeopardy: an invertible functional programming language. CoRR, arXiv:2209.02422 (2022)"},{"key":"3_CR44","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.scico.2017.09.008","volume":"151","author":"S Kuhn","year":"2018","unstructured":"Kuhn, S., Ulidowski, I.: Local reversibility in a calculus of covalent bonding. Sci. Comput. Program. 151, 18\u201347 (2018)","journal-title":"Sci. Comput. Program."},{"key":"3_CR45","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.tcs.2022.06.009","volume":"925","author":"S Kuhn","year":"2022","unstructured":"Kuhn, S., Ulidowski, I.: Modelling of DNA mismatch repair with a reversible process calculus. Theor. Comput. Sci. 925, 68\u201386 (2022)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"3_CR46","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1016\/j.jcss.2011.12.004","volume":"78","author":"M Kutrib","year":"2012","unstructured":"Kutrib, M., Malcher, A.: Reversible pushdown automata. J. Comput. Syst. Sci. 78(6), 1814\u20131827 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"3_CR47","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5(3), 183\u2013191 (1961)","journal-title":"IBM J. Res. Dev."},{"key":"3_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-37036-6_21","volume-title":"Programming Languages and Systems","author":"I Lanese","year":"2013","unstructured":"Lanese, I., Lienhardt, M., Mezzina, C.A., Schmitt, A., Stefani, J.-B.: Concurrent flexible reversibility. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 370\u2013390. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_21"},{"key":"3_CR49","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":"3_CR50","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":"3_CR51","doi-asserted-by":"crossref","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.-B.: Reversibility in the higher-order $$\\pi $$-calculus. Theor. Comput. Sci. 625, 25\u201384 (2016)","DOI":"10.1016\/j.tcs.2016.02.019"},{"key":"3_CR52","unstructured":"Lanese, I., Mezzina, C.A., Tiezzi, F.: Causal-consistent reversibility. Bull. EATCS 114 (2014)"},{"key":"3_CR53","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. Algebr. Meth. Program. 100, 71\u201397 (2018)","journal-title":"J. Log. Algebr. Meth. Program."},{"issue":"3","key":"3_CR54","doi-asserted-by":"publisher","first-page":"229","DOI":"10.3233\/FI-2021-2005","volume":"178","author":"I Lanese","year":"2021","unstructured":"Lanese, I., Palacios, A., Vidal, G.: Causal-consistent replay reversible semantics for message passing concurrent programs. Fundam. Informaticae 178(3), 229\u2013266 (2021)","journal-title":"Fundam. Informaticae"},{"key":"3_CR55","doi-asserted-by":"crossref","unstructured":"Lanese, I., Schultz, U.P., Ulidowski, I.: Reversible computing in debugging of Erlang programs. IT Prof. 24(1), 74\u201380 (2022)","DOI":"10.1109\/MITP.2021.3117920"},{"key":"3_CR56","doi-asserted-by":"crossref","unstructured":"Laursen, J.S., Ellekilde, L.-P.: Schultz, U.P.: Modelling reversible execution of robotic assembly. Robotica 36(5), 625\u2013654 (2018)","DOI":"10.1017\/S0263574717000613"},{"issue":"11","key":"3_CR57","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"key":"3_CR58","doi-asserted-by":"crossref","unstructured":"Matsuda, K., Hu, Z., Nakano, K., Hamana, M., Takeichi, M.: Bidirectionalization transformation based on automatic derivation of view complement functions. In: ICFP 2007, PP. 47\u201358. ACM (2007)","DOI":"10.1145\/1291220.1291162"},{"key":"3_CR59","unstructured":"McNellis, J., Mola, J., Sykes, K.: Time travel debugging: root causing bugs in commercial scale software. CppCon talk (2017). https:\/\/www.youtube.com\/watch?v=l1YJTg_A914"},{"key":"3_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-030-79837-6_7","volume-title":"Reversible Computation","author":"H Melgratti","year":"2021","unstructured":"Melgratti, H., Mezzina, C.A., Pinna, G.M.: Towards a truly concurrent semantics for reversible CCS. In: Yamashita, S., Yokoyama, T. (eds.) RC 2021. LNCS, vol. 12805, pp. 109\u2013125. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79837-6_7"},{"key":"3_CR61","doi-asserted-by":"crossref","unstructured":"Melgratti, H.C., Mezzina, C.A., Pinna, G.M.: A Petri net view of covalent bonds. Theor. Comput. Sci. 908, 89\u2013119 (2022)","DOI":"10.1016\/j.tcs.2022.01.013"},{"key":"3_CR62","unstructured":"Melgratti, H.C., Mezzina, C.A., Ulidowski, I.: Reversing place transition nets. Log. Methods Comput. Sci. 16(4) (2020)"},{"key":"3_CR63","doi-asserted-by":"crossref","unstructured":"Mimram, S., Di Giusto, C.: A categorical theory of patches. In: MFPS XXIX. Electronic Notes in Theoretical Computer Science, vol. 298, PP. 283\u2013307. Elsevier (2013)","DOI":"10.1016\/j.entcs.2013.09.018"},{"issue":"3","key":"3_CR64","first-page":"305","volume":"59","author":"J Miszczak","year":"2011","unstructured":"Miszczak, J.: Models of quantum computation and quantum programming languages. Bull. Polish Acad. Sci. Tech. Sci. 59(3), 305\u2013324 (2011)","journal-title":"Bull. Polish Acad. Sci. Tech. Sci."},{"key":"3_CR65","doi-asserted-by":"publisher","unstructured":"Miszczak, J.: High Level Structures for Quantum Computing. Springer, Cham (2012). https:\/\/doi.org\/10.1007\/978-3-031-02516-7","DOI":"10.1007\/978-3-031-02516-7"},{"issue":"6","key":"3_CR66","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0020-0190(92)90231-J","volume":"42","author":"K Morita","year":"1992","unstructured":"Morita, K.: Computation-universality of one-dimensional one-way reversible cellular automata. Inf. Process. Lett. 42(6), 325\u2013329 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"3_CR67","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2008.01.041","volume":"395","author":"K Morita","year":"2008","unstructured":"Morita, K.: Reversible computing and cellular automata\u2013a survey. Theor. Comput. Sci. 395(1), 101\u2013131 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR68","doi-asserted-by":"publisher","unstructured":"Morita, K.: Theory of Reversible Computing. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Tokyo (2017). https:\/\/doi.org\/10.1007\/978-4-431-56606-9","DOI":"10.1007\/978-4-431-56606-9"},{"issue":"1\u20132","key":"3_CR69","first-page":"101","volume":"12","author":"D Morrison","year":"2016","unstructured":"Morrison, D., Ulidowski, I.: Direction-reversible self-timed cellular automata for delay-insensitive circuits. J. Cell. Autom. 12(1\u20132), 101\u2013120 (2016)","journal-title":"J. Cell. Autom."},{"key":"3_CR70","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2021.102748","volume":"215","author":"K Nakano","year":"2022","unstructured":"Nakano, K.: Time-symmetric Turing machines for computable involutions. Sci. Comput. Program. 215, 102748 (2022)","journal-title":"Sci. Comput. Program."},{"issue":"2","key":"3_CR71","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab79b1","volume":"5","author":"B Nash","year":"2020","unstructured":"Nash, B., Gheorghiu, V., Mosca, M.: Quantum circuit optimizations for NISQ architectures. Quantum Sci. Technol. 5(2), 025010 (2020)","journal-title":"Quantum Sci. Technol."},{"key":"3_CR72","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.jlamp.2017.10.003","volume":"94","author":"N Nishida","year":"2018","unstructured":"Nishida, N., Palacios, A., Vidal, G.: Reversible computation in term rewriting. J. Log. Algebr. Methods Program. 94, 128\u2013149 (2018)","journal-title":"J. Log. Algebr. Methods Program."},{"key":"3_CR73","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-21500-2_5","volume-title":"Reversible Computation","author":"N Nishida","year":"2019","unstructured":"Nishida, N., Vidal, G.: Characterizing compatible view updates in syntactic bidirectionalization. In: Thomsen, M.K., Soeken, M. (eds.) RC 2019. LNCS, vol. 11497, pp. 67\u201383. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21500-2_5"},{"key":"3_CR74","unstructured":"\u00d6mer, B.: Structured Quantum Programming. Ph.D. thesis, Vienna University of Technology (2003)"},{"issue":"3","key":"3_CR75","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00354-018-0039-1","volume":"36","author":"L Paolini","year":"2018","unstructured":"Paolini, L., Piccolo, M., Roversi, L.: On a class of reversible primitive recursive functions and its Turing-complete extensions. New Gener. Comput. 36(3), 233\u2013256 (2018)","journal-title":"New Gener. Comput."},{"key":"3_CR76","doi-asserted-by":"crossref","unstructured":"Perumalla, K.S.:Introduction to Reversible Computing. CRC Press\/Taylor & Francis Group (2014)","DOI":"10.1201\/b15719"},{"key":"3_CR77","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"},{"key":"3_CR78","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.tcs.2022.05.016","volume":"924","author":"A Philippou","year":"2022","unstructured":"Philippou, A., Psara, K.: A collective interpretation semantics for reversing Petri nets. Theor. Comput. Sci. 924, 148\u2013170 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR79","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-40184-8_22","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"I Phillips","year":"2013","unstructured":"Phillips, I., Ulidowski, I.: Reversibility and asymmetric conflict in event structures. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol. 8052, pp. 303\u2013318. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40184-8_22"},{"key":"3_CR80","doi-asserted-by":"crossref","unstructured":"Phillips, I., Ulidowski, I.: Event identifier logic. Math. Struct. Comput. Sci. 24(2) (2014)","DOI":"10.1017\/S0960129513000510"},{"issue":"6","key":"3_CR81","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1016\/j.jlamp.2015.07.004","volume":"84","author":"I Phillips","year":"2015","unstructured":"Phillips, I., Ulidowski, I.: Reversibility and asymmetric conflict in event structures. J. Log. Algebr. Methods Program. 84(6), 781\u2013805 (2015)","journal-title":"J. Log. Algebr. Methods Program."},{"key":"3_CR82","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-36315-3_18","volume-title":"Reversible Computation","author":"I Phillips","year":"2013","unstructured":"Phillips, I., Ulidowski, I., Yuen, S.: A reversible process calculus and the modelling of the ERK signaling pathway. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 218\u2013232. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36315-3_18"},{"key":"3_CR83","doi-asserted-by":"crossref","unstructured":"Phillips, I.C.C., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebr. Program. 73(1\u20132), 70\u201396 (2007)","DOI":"10.1016\/j.jlap.2006.11.002"},{"key":"3_CR84","doi-asserted-by":"crossref","unstructured":"Schordan, M., Oppelstrup, T., Jefferson, D.R., Barnes Jr., P.D.: Generation of reversible C++ code for optimistic parallel discrete event simulation. New Gener. Comput. 36(3), 257\u2013280 (2018)","DOI":"10.1007\/s00354-018-0038-2"},{"key":"3_CR85","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-319-40578-0_10","volume-title":"Reversible Computation","author":"UP Schultz","year":"2016","unstructured":"Schultz, U.P., Axelsen, H.B.: Elements of a reversible object-oriented language. In: Devitt, S., Lanese, I. (eds.) RC 2016. LNCS, vol. 9720, pp. 153\u2013159. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40578-0_10"},{"key":"3_CR86","doi-asserted-by":"crossref","unstructured":"Schultz, U.P., Bordignon, M., St\u00f8y, K.: Robust and reversible execution of self-reconfiguration sequences. Robotica 29(1), 35\u201357 (2011)","DOI":"10.1017\/S0263574710000664"},{"issue":"5","key":"3_CR87","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1109\/LWC.2019.2920128","volume":"8","author":"H Siljak","year":"2019","unstructured":"Siljak, H., Psara, K., Philippou, A.: Distributed antenna selection for massive MIMO using reversing Petri nets. IEEE Wirel. Commun. Lett. 8(5), 1427\u20131430 (2019)","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"3_CR88","doi-asserted-by":"crossref","unstructured":"Thomsen, M.K., Axelsen, H.B.: Interpretation and programming of the reversible functional language RFUN. In: IFL 2015, pp. 8:1\u20138:13. ACM (2015)","DOI":"10.1145\/2897336.2897345"},{"key":"3_CR89","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-29517-1_3","volume-title":"Reversible Computation","author":"MK Thomsen","year":"2012","unstructured":"Thomsen, M.K., Axelsen, H.B., Gl\u00fcck, R.: A reversible processor architecture and its reversible logic design. In: De Vos, A., Wille, R. (eds.) RC 2011. LNCS, vol. 7165, pp. 30\u201342. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29517-1_3"},{"key":"3_CR90","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/3-540-10003-2_104","volume-title":"Automata, Languages and Programming","author":"T Toffoli","year":"1980","unstructured":"Toffoli, T.: Reversible computing. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 632\u2013644. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_104"},{"key":"3_CR91","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1763.001.0001","volume-title":"Cellular Automata Machines. A New Environment for Modeling","author":"T Toffoli","year":"1987","unstructured":"Toffoli, T., Margolus, N.: Cellular Automata Machines. A New Environment for Modeling. MIT Press, Cambridge (1987)"},{"issue":"3","key":"3_CR92","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00354-018-0040-8","volume":"36","author":"I Ulidowski","year":"2018","unstructured":"Ulidowski, I., Phillips, I., Yuen, S.: Reversing event structures. New Gener. Comput. 36(3), 281\u2013306 (2018)","journal-title":"New Gener. Comput."},{"key":"3_CR93","unstructured":"Undo, UDB - reverse debugger for C\/C++ (2020). https:\/\/undo.io"},{"key":"3_CR94","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-030-79837-6_10","volume-title":"Reversible Computation","author":"M Vassor","year":"2021","unstructured":"Vassor, M.: Reversibility and predictions. In: Yamashita, S., Yokoyama, T. (eds.) RC 2021. LNCS, vol. 12805, pp. 163\u2013181. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79837-6_10"},{"key":"3_CR95","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-29517-1_2","volume-title":"Reversible Computation","author":"T Yokoyama","year":"2012","unstructured":"Yokoyama, T., Axelsen, H.B., Gl\u00fcck, R.: Towards a reversible functional language. In: De Vos, A., Wille, R. (eds.) RC 2011. LNCS, vol. 7165, pp. 14\u201329. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29517-1_2"},{"key":"3_CR96","doi-asserted-by":"crossref","unstructured":"Yokoyama, T., Axelsen, H.B., Gl\u00fcck, R.: Fundamentals of reversible flowchart languages. Theor. Comput. Sci. 611, 87\u2013115 (2016)","DOI":"10.1016\/j.tcs.2015.07.046"},{"key":"3_CR97","doi-asserted-by":"crossref","unstructured":"Yokoyama, T., Gl\u00fcck, R.: A reversible programming language and its invertible self-interpreter. In: PEPM 2007, pp. 144\u2013153. ACM (2007)","DOI":"10.1145\/1244381.1244404"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T22:01:56Z","timestamp":1689112916000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38100-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031380990","9783031381003"],"references-count":97,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38100-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}