{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T12:48:40Z","timestamp":1784206120104,"version":"3.55.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030549961","type":"print"},{"value":"9783030549978","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-54997-8_26","type":"book-chapter","created":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T20:11:50Z","timestamp":1597090310000},"page":"413-427","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Reversible Programs Have Reversible Semantics"],"prefix":"10.1007","author":[{"given":"Robert","family":"Gl\u00fcck","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robin","family":"Kaarsgaard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tetsuo","family":"Yokoyama","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,8,11]]},"reference":[{"key":"26_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 \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). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74510-5_9"},{"issue":"4","key":"26_CR2","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1017\/S0960129507006056","volume":"17","author":"R Cockett","year":"2007","unstructured":"Cockett, R., Lack, S.: Restriction categories III: colimits, partial limits and extensivity. Math. Struct. Comput. Sci. 17(4), 775\u2013817 (2007)","journal-title":"Math. Struct. Comput. Sci."},{"key":"26_CR3","unstructured":"Frank, M.P.: Reversibility for efficient computing. Ph.D. thesis, MIT (1999)"},{"key":"26_CR4","unstructured":"Giles, B.: An investigation of some theoretical aspects of reversible computing. Ph.D. thesis, University of Calgary (2014)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R., Kaarsgaard, R.: A categorical foundation for structured reversible flowchart languages: Soundness and adequacy. Log. Methods Comput. Sci. 14(3) (2018)","DOI":"10.1016\/j.entcs.2018.03.021"},{"issue":"5","key":"26_CR6","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/1071221.1071222","volume":"40","author":"R Gl\u00fcck","year":"2005","unstructured":"Gl\u00fcck, R., Kawabe, M.: Revisiting an automatic program inverter for Lisp. SIGPLAN Not. 40(5), 8\u201317 (2005)","journal-title":"SIGPLAN Not."},{"issue":"5","key":"26_CR7","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1587\/transinf.2016EDP7274","volume":"100","author":"R Gl\u00fcck","year":"2017","unstructured":"Gl\u00fcck, R., Yokoyama, T.: A minimalist\u2019s reversible while language. IEICE Trans. Inf. Syst. E100-D 100(5), 1026\u20131034 (2017)","journal-title":"IEICE Trans. Inf. Syst. E100-D"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.ipl.2019.03.002","volume":"147","author":"R Gl\u00fcck","year":"2019","unstructured":"Gl\u00fcck, R., Yokoyama, T.: Constructing a binary tree from its traversals by reversible recursion and iteration. IPL 147, 32\u201337 (2019)","journal-title":"IPL"},{"key":"26_CR9","unstructured":"Haghverdi, E.: A categorical approach to linear logic, geometry of proofs and full completeness. Ph.D. thesis, Carlton Univ. and Univ. Ottawa (2000)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Hoey, J., Ulidowski, I., Yuen, S.: Reversing parallel programs with blocks and procedures. In: P\u00e9rez, J.A., Tini, S. (eds.) Expressiveness in Concurrency, Structural Operational Semantics. Electronic Proceedings in TCS, vol. 276, pp. 69\u201386 (2018)","DOI":"10.4204\/EPTCS.276.7"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-59936-6_3","volume-title":"Reversible Computation","author":"M Holzer","year":"2017","unstructured":"Holzer, M., Kutrib, M.: Reversible nondeterministic finite automata. In: Phillips, I., Rahaman, H. (eds.) RC 2017. LNCS, vol. 10301, pp. 35\u201351. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-59936-6_3"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"James, R.P., Sabry, A.: Information effects. In: POPL, pp. 73\u201384. ACM (2012)","DOI":"10.1145\/2103621.2103667"},{"key":"26_CR13","first-page":"33","volume":"87","author":"R Kaarsgaard","year":"2017","unstructured":"Kaarsgaard, R., Axelsen, H.B., Gl\u00fcck, R.: Join inverse categories and reversible recursion. J. Log. Algebr. Methods 87, 33\u201350 (2017)","journal-title":"J. Log. Algebr. Methods"},{"issue":"3","key":"26_CR14","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":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-40578-0_2","volume-title":"Reversible Computation","author":"S Kuhn","year":"2016","unstructured":"Kuhn, S., Ulidowski, I.: A calculus for local reversibility. In: Devitt, S., Lanese, I. (eds.) RC 2016. LNCS, vol. 9720, pp. 20\u201335. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-40578-0_2"},{"issue":"1","key":"26_CR16","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 \u2013 a survey. Theor. Comput. Sci. 395(1), 101\u2013131 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR17","series-title":"LNP","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-12821-9_4","volume-title":"New Structures for Physics","author":"P Selinger","year":"2011","unstructured":"Selinger, P.: A survey of graphical languages for monoidal categories. In: Coecke, B. (ed.) New Structures for Physics. LNP, vol. 813, pp. 289\u2013355. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-12821-9_4"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.vlsi.2015.10.001","volume":"53","author":"R Wille","year":"2016","unstructured":"Wille, R., Sch\u00f6nborn, E., Soeken, M., Drechsler, R.: SyReC: a hardware description language for the specification and synthesis of reversible circuits. Integration 53, 39\u201353 (2016)","journal-title":"Integration"},{"key":"26_CR19","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The Formal Semantics of Programming Languages: An Introduction","author":"G Winskel","year":"1993","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages: An Introduction. MIT Press, Cambridge (1993)"},{"key":"26_CR20","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-29517-1_2"},{"key":"26_CR21","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":"26_CR22","doi-asserted-by":"crossref","unstructured":"Yokoyama, T., Gl\u00fcck, R.: A reversible programming language and its invertible self-interpreter. In: PEPM, pp. 144\u2013153. ACM (2007)","DOI":"10.1145\/1244381.1244404"}],"container-title":["Lecture Notes in Computer Science","Formal Methods. FM 2019 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54997-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T20:18:26Z","timestamp":1597090706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-54997-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549961","9783030549978"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54997-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"11 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2019.inesctec.pt\/?page_id=84","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":"129","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":"44","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":"7","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":"34% - 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":"4","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":"5,5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}