{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T12:47:36Z","timestamp":1784206056819,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642232169","type":"print"},{"value":"9783642232176","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23217-6_20","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T09:14:02Z","timestamp":1314263642000},"page":"297-311","source":"Crossref","is-referenced-by-count":60,"title":["Controlling Reversibility in Higher-Order Pi"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Lanese","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claudio Antares","family":"Mezzina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alan","family":"Schmitt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Bernard","family":"Stefani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Avizienis, A., Laprie, J.C., Randell, B., Landwehr, C.E.: Basic concepts and taxonomy of dependable and secure computing. IEEE Trans. Dependable Sec. Comput.\u00a01(1) (2004)","DOI":"10.1109\/TDSC.2004.2"},{"key":"20_CR2","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":"20_CR3","doi-asserted-by":"crossref","unstructured":"Chothia, T., Duggan, D.: Abstractions for fault-tolerant global computing. Theor. Comput. Sci.\u00a0322(3) (2004)","DOI":"10.1016\/j.tcs.2003.09.014"},{"key":"20_CR4","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":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11539452_31","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"V. Danos","year":"2005","unstructured":"Danos, V., Krivine, J.: Transactions in RCCS. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 398\u2013412. Springer, Heidelberg (2005)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Elnozahy, E.N., Alvisi, L., Wang, Y.M., Johnson, D.B.: A survey of rollback-recovery protocols in message-passing systems. ACM Comput. Surv.\u00a034(3) (2002)","DOI":"10.1145\/568522.568525"},{"key":"20_CR7","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, New York (2005)","DOI":"10.1145\/1040305.1040322"},{"key":"20_CR8","unstructured":"Lanese, I., Mezzina, C.A., Schmitt, A., Stefani, J.B.: Controlling reversibility in higher-order pi (TR), \n                    \n                      http:\/\/www.cs.unibo.it\/~lanese\/publications\/fulltext\/TR-rollpi.pdf.gz"},{"key":"20_CR9","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-642-15375-4_33"},{"key":"20_CR10","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":"20_CR11","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST\u201399\u201393, University of Edinburgh (1992)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Ziarek, L., Jagannathan, S.: Lightweight checkpointing for concurrent ML. J. Funct. Program.\u00a020(2) (2010)","DOI":"10.1017\/S0956796810000067"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2011 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23217-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:16:55Z","timestamp":1558297015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23217-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232169","9783642232176"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23217-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}