{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:41Z","timestamp":1759637801757,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s00354-022-00169-z","type":"journal-article","created":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T16:03:08Z","timestamp":1656950588000},"page":"467-480","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Making Programs Reversible with Minimal Extra Data"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-6990-3935","authenticated-orcid":false,"given":"Robert","family":"Gl\u00fcck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-7677-143X","authenticated-orcid":false,"given":"Tetsuo","family":"Yokoyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,4]]},"reference":[{"issue":"2\u20133","key":"169_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0167-6423(02)00023-0","volume":"43","author":"SM Abramov","year":"2002","unstructured":"Abramov, S.M., Gl\u00fcck, R.: The universal resolving algorithm and its correctness: inverse computation in a functional language. Sci. Comput. Program. 43(2\u20133), 193\u2013229 (2002)","journal-title":"Sci. Comput. Program."},{"key":"169_CR2","doi-asserted-by":"crossref","unstructured":"Axelsen, H.B., Yokoyama, T.: Programming techniques for reversible comparison sorts. In: Feng, X., Park, S. (eds.) Programming Languages and Systems. Proceedings, vol. 9458. Lecture Notes in Computer Science, pp. 407\u2013426. Springer, Berlin (2015)","DOI":"10.1007\/978-3-319-26529-2_22"},{"issue":"6","key":"169_CR3","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."},{"issue":"4","key":"169_CR4","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"CH Bennett","year":"1989","unstructured":"Bennett, C.H.: Time\/space trade-offs for reversible computation. SIAM J. Comput. 18(4), 766\u2013776 (1989)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"169_CR5","doi-asserted-by":"publisher","first-page":"660","DOI":"10.3390\/e22060660","volume":"22","author":"A De Vos","year":"2020","unstructured":"De Vos, A.: Endoreversible models for the thermodynamics of computing. Entropy 22(6), 660 (2020)","journal-title":"Entropy"},{"key":"169_CR6","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: Program inversion. In: Bauer, F.L., Broy, M. (eds.) Program Construction: International Summer School, vol.\u00a069. Lecture Notes in Computer Science, pp. 54\u201357. Springer, Berlin (1979)","DOI":"10.1007\/BFb0014657"},{"key":"169_CR7","volume-title":"Feynman Lectures on Computation","author":"RP Feynman","year":"1996","unstructured":"Feynman, R.P.: Feynman Lectures on Computation. Addison-Wesley, Boston (1996)"},{"key":"169_CR8","unstructured":"Frank, M.P.: Reversibility for efficient computing. PhD thesis, Massachusetts Institute of Technology (1999)"},{"issue":"1","key":"169_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF03037260","volume":"20","author":"Y Futamura","year":"2002","unstructured":"Futamura, Y., Konishi, Z., Gl\u00fcck, R.: Program transformation system based on generalized partial computation. New Gener. Comput. 20(1), 75\u201399 (2002)","journal-title":"New Gener. Comput."},{"key":"169_CR10","first-page":"10","volume-title":"Transforming interpreters into inverse interpreters by partial evaluation. In: Partial Evaluation and Semantics-Based Program Manipulation. Proceedings,","author":"R Gl\u00fcck","year":"2003","unstructured":"Gl\u00fcck, R., Kawada, Y., Hashimoto, T.: Transforming interpreters into inverse interpreters by partial evaluation. In: Partial Evaluation and Semantics-Based Program Manipulation. Proceedings, pp. 10\u201319. ACM Press, New York (2003)"},{"issue":"3","key":"169_CR11","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":"169_CR12","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R., Yokoyama, T.: Reversible computing from a programming language perspective. Theor. Comput. Sci. (2022, in preparation)","DOI":"10.1016\/j.tcs.2022.06.010"},{"key":"169_CR13","doi-asserted-by":"crossref","unstructured":"Hagiya, M., et\u00a0al.: On DNA-based gellular automata. In: Ibarra, O.H., Kari, L., Kopecki, S. (eds.) Unconventional Computation and Natural Computation. Proceedings, vol. 8553. Lecture Notes in Computer Science, pp. 177\u2013189. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-08123-6_15"},{"key":"169_CR14","unstructured":"Jones, N.D.: Computability and Complexity: From a Programming Perspective. MIT Press, Cambridge (1997). Revised version, available from https:\/\/2.zoppoz.workers.dev:443\/http\/www.diku.dk\/~neil\/Comp2book.html"},{"key":"169_CR15","doi-asserted-by":"crossref","unstructured":"Kawabe, M., Gl\u00fcck, R.: The program inverter LRinv and its structure. In: Hermenegildo, M., Cabeza, D. (eds.) Practical Aspects of Declarative Languages. Proceedings, vol. 3350. Lecture Notes in Computer Science, pp. 219\u2013234. Springer, Berlin (2005)","DOI":"10.1007\/978-3-540-30557-6_17"},{"issue":"6","key":"169_CR16","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/3460214","volume":"64","author":"M Krakovsky","year":"2021","unstructured":"Krakovsky, M.: Taking the heat. Commun. ACM 64(6), 18\u201320 (2021)","journal-title":"Commun. ACM"},{"issue":"3","key":"169_CR17","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."},{"issue":"2","key":"169_CR18","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1006\/jcss.1999.1672","volume":"60","author":"K-J Lange","year":"2000","unstructured":"Lange, K.-J., McKenzie, P., Tapp, A.: Reversible space equals deterministic space. J. Comput. Syst. Sci. 60(2), 354\u2013367 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"169_CR19","unstructured":"Levin, L.A.: Universal sequential search problems. Probl. Inf. Transm. 9(3), 265\u2013266 (1975). Translated from Probl. Peredachi Inf. 9(3), 115\u2013116 (1973)"},{"key":"169_CR20","doi-asserted-by":"crossref","unstructured":"Maslov, D., Dueck, G.W.: Reversible cascades with minimal garbage. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(11), 1497\u20131509 (2006)","DOI":"10.1109\/TCAD.2004.836735"},{"key":"169_CR21","first-page":"177","volume-title":"Automata Studies","author":"J McCarthy","year":"1956","unstructured":"McCarthy, J.: The inversion of functions defined by Turing machines. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 177\u2013181. Princeton University Press, Princeton (1956)"},{"key":"169_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-4-431-56606-9","volume-title":"Theory of Reversible Computing","author":"K Morita","year":"2017","unstructured":"Morita, K.: Theory of Reversible Computing. Monographs in Theoretical Computer Science. Springer, Berlin (2017)"},{"key":"169_CR23","doi-asserted-by":"publisher","DOI":"10.1201\/b15719","volume-title":"Introduction to Reversible Computing","author":"KS Perumalla","year":"2013","unstructured":"Perumalla, K.S.: Introduction to Reversible Computing. CRC Press, Boca Raton (2013)"},{"key":"169_CR24","doi-asserted-by":"crossref","unstructured":"Toffoli, T.: Reversible computing. In: de Bakker, J., van Leeuwen, J. (eds.) Automata, Languages and Programming. Proceedings, vol.\u00a085. Lecture Notes in Computer Science, pp. 632\u2013644. Springer, Berlin (1980)","DOI":"10.1007\/3-540-10003-2_104"},{"key":"169_CR25","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2015.07.046","volume":"611","author":"T Yokoyama","year":"2016","unstructured":"Yokoyama, T., Axelsen, H.B., Gl\u00fcck, R.: Fundamentals of reversible flowchart languages. Theor. Comput. Sci. 611, 87\u2013115 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"169_CR26","first-page":"144","volume-title":"A reversible programming language and its invertible self-interpreter. In: Partial Evaluation and Semantics-Based Program Manipulation. Proceedings,","author":"T Yokoyama","year":"2007","unstructured":"Yokoyama, T., Gl\u00fcck, R.: A reversible programming language and its invertible self-interpreter. In: Partial Evaluation and Semantics-Based Program Manipulation. Proceedings, pp. 144\u2013153. ACM Press, New York (2007)"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s00354-022-00169-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s00354-022-00169-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s00354-022-00169-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T20:21:51Z","timestamp":1676060511000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/s00354-022-00169-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["169"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s00354-022-00169-z","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"type":"print","value":"0288-3635"},{"type":"electronic","value":"1882-7055"}],"subject":[],"published":{"date-parts":[[2022,7]]},"assertion":[{"value":"22 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}