{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:47:55Z","timestamp":1760820475076},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642307928"},{"type":"electronic","value":"9783642307935"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30793-5_1","type":"book-chapter","created":{"date-parts":[[2012,6,8]],"date-time":"2012-06-08T11:34:33Z","timestamp":1339155273000},"page":"1-17","source":"Crossref","is-referenced-by-count":20,"title":["A Reversible Abstract Machine and Its Space Overhead"],"prefix":"10.1007","author":[{"given":"Michael","family":"Lienhardt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Lanese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio Antares","family":"Mezzina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Bernard","family":"Stefani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Altenkirch, T., Grattage, J.: A functional quantum programming language. In: Proc. of LICS 2005 (2005)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-19861-8_9","volume-title":"Compiler Construction","author":"H.B. Axelsen","year":"2011","unstructured":"Axelsen, H.B.: Clean Translation of an Imperative Reversible Programming Language. In: Knoop, J. (ed.) CC 2011. LNCS, vol.\u00a06601, pp. 144\u2013163. Springer, Heidelberg (2011)"},{"key":"1_CR3","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":"H.B. 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.\u00a04649, pp. 56\u201369. Springer, Heidelberg (2007)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bennett, C.H.: Notes on the history of reversible computation. IBM Journal of Research and Development\u00a032(1) (1988)","DOI":"10.1147\/rd.321.0016"},{"key":"1_CR5","unstructured":"Brown, A.B., Patterson, D.A.: Undo for operators: Building an undoable e-mail store. In: USENIX Annual Technical Conference, General Track. USENIX (2003)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/3-540-48224-5_82","volume-title":"Automata, Languages and Programming","author":"H. Buhrman","year":"2001","unstructured":"Buhrman, H., Tromp, J., Vit\u00e1nyi, P.M.B.: Time and Space Bounds for Reversible Simulation. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 1017\u20131027. Springer, Heidelberg (2001)"},{"key":"1_CR7","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.\u00a03170, pp. 292\u2013307. Springer, Heidelberg (2004)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Danos, V., Regnier, L.: Reversible, irreversible and optimal lambda-machines. Theor. Comput. Sci.\u00a0227(1-2) (1999)","DOI":"10.1016\/S0304-3975(99)00049-3"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Field, J., Varela, C.A.: Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments. In: Proc. of POPL 2005. ACM (2005)","DOI":"10.1145\/1040305.1040322"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Frank, M.P.: Introduction to reversible computing: motivation, progress, and challenges. In: 2nd Conference on Computing Frontiers. ACM (2005)","DOI":"10.1145\/1062261.1062324"},{"key":"1_CR11","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 \u2013 Concurrency Theory. LNCS, vol.\u00a06901, pp. 297\u2013311. Springer, Heidelberg (2011)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-15375-4_33","volume-title":"CONCUR 2010 - Concurrency Theory","author":"I. Lanese","year":"2010","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.B.: Reversing Higher-Order Pi. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 478\u2013493. Springer, Heidelberg (2010)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Leeman, G.B.: A formal approach to undo operations in programming languages. ACM Trans. Program. Lang. Syst.\u00a08(1) (1986)","DOI":"10.1145\/5001.5005"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer (2008)","DOI":"10.1007\/978-0-387-49820-1"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Ringenburg, M.F., Grossman, D.: AtomCaml: first-class atomicity via rollback. In: Proc. of ICFP 2005. ACM (2005)","DOI":"10.1145\/1086365.1086378"},{"key":"1_CR16","unstructured":"Van Roy, P., Haridi, S.: Concepts, Techniques and Models of Computer Programming. MIT Press (2004)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Vit\u00e1nyi, P.M.B.: Time, space, and energy in reversible computing. In: 2nd Conference on Computing Frontiers. ACM (2005)","DOI":"10.1145\/1062261.1062335"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Yokoyama, T.: Reversible computation and reversible programming languages. Electr. Notes Theor. Comput. Sci.\u00a0253(6) (2010)","DOI":"10.1016\/j.entcs.2010.02.007"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Yokoyama, T., Gl\u00fcck, R.: A reversible programming language and its invertible self-interpreter. In: Proc. of PEPM 2007. ACM (2007)","DOI":"10.1145\/1244381.1244404"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30793-5_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:30:47Z","timestamp":1620127847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30793-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642307928","9783642307935"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30793-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}