{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:03:14Z","timestamp":1742979794632,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031620751"},{"type":"electronic","value":"9783031620768"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-62076-8_11","type":"book-chapter","created":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T09:02:35Z","timestamp":1716886955000},"page":"161-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Connecting Reversible and Classical Computing Through Hybrid SSA"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3268-8562","authenticated-orcid":false,"given":"Lukas","family":"Gail","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0216-8803","authenticated-orcid":false,"given":"Uwe","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,29]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Appel, A.W.: SSA is functional programming. ACM SIGPLAN Notices 33(4), 17\u201320 (1998). http:\/\/dblp.uni-trier.de\/db\/journals\/sigplan\/sigplan33.html#Appel88","DOI":"10.1145\/278283.278285"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Deworetzki, N., Gail, L.: Optimization of reversible control flow graphs. In: Kutrib, M., Meyer, U. (eds.) Reversible Computation. RC 2023. LNCS, vol. 13960, pp. 57\u201372. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38100-3_5","DOI":"10.1007\/978-3-031-38100-3_5"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Deworetzki, N., Meyer, U.: Program analysis for reversible languages. In: Proceedings of the 10th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis, pp. 13\u201318 (2021)","DOI":"10.1145\/3460946.3464314"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Frank, M.P.: Introduction to reversible computing: motivation, progress, and challenges. In: Proceedings of the 2nd Conference on Computing Frontiers. p. 385-390. CF \u201905, Association for Computing Machinery, New York, NY, USA (2005). https:\/\/doi.org\/10.1145\/1062261.1062324","DOI":"10.1145\/1062261.1062324"},{"issue":"08","key":"11_CR5","first-page":"2017","volume":"25","author":"MP Frank","year":"2017","unstructured":"Frank, M.P.: The future of computing depends on making it reversible. IEEE Spectr. 25(08), 2017 (2017)","journal-title":"IEEE Spectr."},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Giachino, E., Lanese, I., Mezzina, C.A.: Causal-consistent reversible debugging. In: Gnesi, S., Rensink, A. (eds.) Fundamental Approaches to Software Engineering. FASE 2014. LNCS, vol. 8411, pp. 370\u2013384. Springer, Berlin, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54804-8_26","DOI":"10.1007\/978-3-642-54804-8_26"},{"key":"11_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2022.06.010","volume":"953","author":"R Gl\u00fcck","year":"2023","unstructured":"Gl\u00fcck, R., Yokoyama, T.: Reversible computing from a programming language perspective. Theor. Comput. Sci. 953, 113429 (2023). https:\/\/doi.org\/10.1016\/J.TCS.2022.06.010","journal-title":"Theor. Comput. Sci."},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Gl\u00fcck, R., Yokoyama, T.: Making programs reversible with minimal extra data. N. Gener. Comput. (2022). https:\/\/doi.org\/10.1007\/s00354-022-00169-z","DOI":"10.1007\/s00354-022-00169-z"},{"issue":"3","key":"11_CR9","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). https:\/\/doi.org\/10.1147\/rd.53.0183","journal-title":"IBM J. Res. Dev."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Matsuda, K., Wang, M.: Sparcl: a language for partially-invertible computation. Proc. ACM Program. Lang. 4(ICFP), 118:1\u2013118:31 (2020). http:\/\/dblp.uni-trier.de\/db\/journals\/pacmpl\/pacmpl4.html#MatsudaW20","DOI":"10.1145\/3409000"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-41579-6_16","volume-title":"Perspectives of System Informatics","author":"T\u00c6 Mogensen","year":"2016","unstructured":"Mogensen, T.\u00c6.: RSSA: a reversible SSA form. In: Mazzara, M., Voronkov, A. (eds.) PSI 2015. LNCS, vol. 9609, pp. 203\u2013217. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41579-6_16"},{"key":"11_CR12","unstructured":"Muchnick, S., et\u00a0al.: Advanced Compiler Design Implementation. Morgan Kaufmann, Burlington (1997)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Global value numbers and redundant computations. In: Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 12\u201327 (1988)","DOI":"10.1145\/73560.73562"},{"key":"11_CR14","unstructured":"Technische Hochschule Mittelhessen: Reversible computing compiler collection (rc3). https:\/\/git.thm.de\/thm-rc3\/release"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Yokoyama, T., Axelsen, H.B., Gl\u00fcck, R.: Principles of a reversible programming language. In: Proceedings of the 5th Conference on Computing Frontiers, pp. 43\u201354. CF \u201908, Association for Computing Machinery, New York, NY, USA (2008). https:\/\/doi.org\/10.1145\/1366230.1366239","DOI":"10.1145\/1366230.1366239"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-70583-3_22","volume-title":"Automata, Languages and Programming","author":"T Yokoyama","year":"2008","unstructured":"Yokoyama, T., Axelsen, H.B., Gl\u00fcck, R.: Reversible flowchart languages and the structured reversible program theorem. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 258\u2013270. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_22"}],"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-62076-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T09:03:55Z","timestamp":1716887035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62076-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031620751","9783031620768"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62076-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 May 2024","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":"Toru\u0144","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rc2024.mat.umk.pl\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}