{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:22Z","timestamp":1759638922403},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_22","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"258-270","source":"Crossref","is-referenced-by-count":22,"title":["Reversible Flowchart Languages and the Structured Reversible Program Theorem"],"prefix":"10.1007","author":[{"given":"Tetsuo","family":"Yokoyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Holger Bock","family":"Axelsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Gl\u00fcck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","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 - Theory and Applications. Proceedings","author":"H.B. Axelsen","year":"2007","unstructured":"Axelsen, H.B., Gl\u00fcck, R., Yokoyama, T.: Reversible machine code and its abstract processor architecture. In: Computer Science - Theory and Applications. Proceedings. LNCS, vol.\u00a04649, pp. 56\u201369. Springer, Heidelberg (2007)"},{"issue":"6","key":"22_CR2","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"C.H. Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev.\u00a017(6), 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"C.H. Bennett","year":"1989","unstructured":"Bennett, C.H.: Time\/space trade-offs for reversible computation. SIAM J. Comput.\u00a018(4), 766\u2013776 (1989)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"22_CR4","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1145\/355592.365646","volume":"9","author":"C. B\u00f6hm","year":"1966","unstructured":"B\u00f6hm, C., Jacopini, G.: Flow diagrams, Turing machines and languages with only two formation rules. Communications of the ACM\u00a09(5), 366\u2013371 (1966)","journal-title":"Communications of the ACM"},{"issue":"8","key":"22_CR5","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/363534.363539","volume":"10","author":"D.C. Cooper","year":"1967","unstructured":"Cooper, D.C.: B\u00f6hm and Jacopini\u2019s reduction of flow charts. Communications of the ACM\u00a010(8), 463\u2013473 (1967)","journal-title":"Communications of the ACM"},{"volume-title":"Structured Programming","year":"1972","key":"22_CR6","unstructured":"Dahl, O.-J., Dijkstra, E.W., Hoare, C.A.R. (eds.): Structured Programming. Academic Press, London (1972)"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1062261.1062270","volume-title":"2nd Conf. on Computing Frontiers","author":"A. Vos De","year":"2005","unstructured":"De Vos, A., Van Rentergem, Y.: Reversible computing: from mathematical group theory to electronical circuit experiment. In: 2nd Conf. on Computing Frontiers, pp. 35\u201344. ACM Press, New York (2005)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","first-page":"54","volume-title":"Program Construction: Intl. Summer School","author":"E.W. Dijkstra","year":"1978","unstructured":"Dijkstra, E.W.: Program inversion. In: Bauer, F.L., Broy, M. (eds.) Program Construction: Intl. Summer School. LNCS, vol.\u00a069, pp. 54\u201357. Springer, Heidelberg (1978)"},{"key":"22_CR9","unstructured":"Frank, M.P.: Reversibility for Efficient Computing. PhD thesis. MIT, Cambridge (1999)"},{"key":"22_CR10","first-page":"123","volume":"12","author":"C.K. Gomard","year":"1991","unstructured":"Gomard, C.K., Jones, N.D.: Compiler generation by partial evaluation: a case study. Structured Programming\u00a012, 123\u2013144 (1991)","journal-title":"Structured Programming"},{"key":"22_CR11","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5983-1","volume-title":"The Science of Programming, ch.21: Inverting Programs","author":"D. Gries","year":"1981","unstructured":"Gries, D.: The Science of Programming, ch.21: Inverting Programs. Texts and Monographs in Computer Science. Springer, Heidelberg (1981)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/3-540-47018-2_2","volume-title":"Partial Evaluation. Practice and Theory","author":"J. Hatcliff","year":"1999","unstructured":"Hatcliff, J.: An introduction to online and offline partial evaluation using a simple flowchart language. In: Hatcliff, J., Mogensen, T., Thiemann, P. (eds.) Partial Evaluation. Practice and Theory. LNCS, vol.\u00a01706, pp. 20\u201382. Springer, Heidelberg (1999)"},{"issue":"2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1137\/0403020","volume":"3","author":"G. Jacopini","year":"1990","unstructured":"Jacopini, G., Mentrasti, P., Sontacchi, G.: Reversible Turing machines and polynomial time reversibly computable functions. SIAM Journal on Discrete Mathematics\u00a03(2), 241\u2013254 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"22_CR14","unstructured":"Lutz, C.: Janus: a time-reversible language. Letter written to \u00a0Landauer, R. (1986), \n                      \n                        http:\/\/www.cise.ufl.edu\/~mpf\/rc\/janus.html"},{"key":"22_CR15","volume-title":"Mathematical Theory of Computation","author":"Z. Manna","year":"1974","unstructured":"Manna, Z.: Mathematical Theory of Computation. McGraw-Hill, New York (1974)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-74593-8_8","volume-title":"Machines, Computations, and Universality. Proceedings","author":"K. Morita","year":"2007","unstructured":"Morita, K., Yamaguchi, Y.: A universal reversible Turing machine. In: Durand-Lose, J., Margenstern, M. (eds.) Machines, Computations, and Universality. Proceedings. LNCS, vol.\u00a04664, pp. 90\u201398. Springer, Heidelberg (2007)"},{"issue":"9","key":"22_CR17","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/1284621.1284643","volume":"50","author":"T. Munakata","year":"2007","unstructured":"Munakata, T.: Beyond silicon: New computing paradigms. Special issue. Communications of the ACM\u00a050(9), 30\u201372 (2007)","journal-title":"Communications of the ACM"},{"key":"22_CR18","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(77)80007-X","volume":"15","author":"T. Toffoli","year":"1977","unstructured":"Toffoli, T.: Computation and construction universality of reversible cellular automata. J. Comput. Sys. Sci.\u00a015, 213\u2013231 (1977)","journal-title":"J. Comput. Sys. Sci."},{"key":"22_CR19","first-page":"43","volume-title":"5th Conf. on Computing Frontiers","author":"T. Yokoyama","year":"2008","unstructured":"Yokoyama, T., Axelsen, H.B., Gl\u00fcck, R.: Principles of a reversible programming language. In: 5th Conf. on Computing Frontiers, pp. 43\u201354. ACM Press, New York (2008)"},{"key":"22_CR20","first-page":"144","volume-title":"Partial Evaluation and 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 Program Manipulation. Proceedings, pp. 144\u2013153. ACM Press, New York (2007)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:23:32Z","timestamp":1620001412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}