{"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":1784206056841,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642370359","type":"print"},{"value":"9783642370366","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37036-6_21","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T14:35:55Z","timestamp":1361198155000},"page":"370-390","source":"Crossref","is-referenced-by-count":40,"title":["Concurrent Flexible Reversibility"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Lanese","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Lienhardt","sequence":"additional","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":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-04081-8_1","volume-title":"CONCUR 2009 - Concurrency Theory","author":"M. Abadi","year":"2009","unstructured":"Abadi, M., Harris, T.: Perspectives on Transactional Memory. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 1\u201314. Springer, Heidelberg (2009)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22944-2_1","volume-title":"Algebra and Coalgebra in Computer Science","author":"G. Bacci","year":"2011","unstructured":"Bacci, G., Danos, V., Kammar, O.: On the Statistical Thermodynamics of Reversible Communicating Processes. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol.\u00a06859, pp. 1\u201318. Springer, Heidelberg (2011)"},{"key":"21_CR3","volume-title":"Mathematical Recreations and Essays","author":"W.W. Rouse Ball","year":"1947","unstructured":"Rouse Ball, W.W.: Mathematical Recreations and Essays, 12th edn. Macmillan, New York (1947)","edition":"12"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Berry, G., L\u00e9vy, J.-J.: Minimal and optimal computations of recursive programs. J. ACM 26(1) (1979)","DOI":"10.1145\/322108.322122"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Bruni, R., Melgratti, H.C., Montanari, U.: Theoretical foundations for compensations in flow composition languages. In: POPL 2005. ACM (2005)","DOI":"10.1145\/1040305.1040323"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Bruni, R., Montanari, U.: Zero-safe nets: Comparing the collective and individual token approaches. Information and Computation 156(1-2) (2000)","DOI":"10.1006\/inco.1999.2819"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/11423348_8","volume-title":"Communicating Sequential Processes. The First 25 Years","author":"M. Butler","year":"2005","unstructured":"Butler, M., Hoare, T., Ferreira, C.: A Trace Semantics for Long-Running Transactions. In: Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds.) CSP25. LNCS, vol.\u00a03525, pp. 133\u2013150. Springer, Heidelberg (2005)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Laneve, C.: Reversible structures. In: CMSB 2011. ACM (2011)","DOI":"10.1145\/2037509.2037529"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Chothia, T., Duggan, D.: Abstractions for fault-tolerant global computing. Theor. Comput. Sci. 322(3) (2004)","DOI":"10.1016\/j.tcs.2003.09.014"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: specification and programming in rewriting logic. Theor. Comp. Sci. 285(2) (2002)","DOI":"10.1016\/S0304-3975(01)00359-0"},{"key":"21_CR11","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":"21_CR12","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":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-642-15375-4_39","volume-title":"CONCUR 2010 - Concurrency Theory","author":"E. Vries de","year":"2010","unstructured":"de Vries, E., Koutavas, V., Hennessy, M.: Communicating Transactions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 569\u2013583. Springer, Heidelberg (2010)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Donnelly, K., Fluet, M.: Transactional events. Journal of Functional Programming 18(5-6) (2008)","DOI":"10.1017\/S0956796808006916"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Field, J., Varela, C.A.: Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments. In: POPL 2005. ACM (2005)","DOI":"10.1145\/1040305.1040322"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Lanese, I., Lienhardt, M., Mezzina, C.A., Schmitt, A., Stefani, J.-B.: Concurrent flexible reversibility, TR (2012), \n                    \n                      http:\/\/www.cs.unibo.it\/~lanese\/publications\/fulltext\/TR-crollpi.pdf.gz","DOI":"10.1007\/978-3-642-37036-6_21"},{"key":"21_CR17","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. LNCS, vol.\u00a06901, pp. 297\u2013311. Springer, Heidelberg (2011)"},{"key":"21_CR18","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":"21_CR19","doi-asserted-by":"crossref","unstructured":"Leeman, G.B.: A formal approach to undo operations in programming languages. ACM Trans. Program. Lang. Syst. 8(1) (1986)","DOI":"10.1145\/5001.5005"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-30793-5_1","volume-title":"Formal Techniques for Distributed Systems","author":"M. Lienhardt","year":"2012","unstructured":"Lienhardt, M., Lanese, I., Mezzina, C.A., Stefani, J.-B.: A Reversible Abstract Machine and Its Space Overhead. In: Giese, H., Rosu, G. (eds.) FMOODS\/FORTE 2012. LNCS, vol.\u00a07273, pp. 1\u201317. Springer, Heidelberg (2012)"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Moore, K.F., Grossman, D.: High-level small-step operational semantics for transactions. In: POPL 2008. ACM (2008)","DOI":"10.1145\/1328438.1328448"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebr. Program. 73(1-2) (2007)","DOI":"10.1016\/j.jlap.2006.11.002"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Phillips, I., Ulidowski, I.: A logic with reverse modalities for history-preserving bisimulations. In: EXPRESS 2011. EPTCS, vol.\u00a064 (2011)","DOI":"10.4204\/EPTCS.64.8"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-36315-3_18","volume-title":"Reversible Computation","author":"I. Phillips","year":"2013","unstructured":"Phillips, I., Ulidowski, I., Yuen, S.: A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol.\u00a07581, pp. 218\u2013232. Springer, Heidelberg (2013)"},{"key":"21_CR25","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: A Theory of Mobile Processes. Cambridge University Press (2001)"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Ziarek, L., Jagannathan, S.: Lightweight checkpointing for concurrent ML. J. Funct. Program. 20(2) (2010)","DOI":"10.1017\/S0956796810000067"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37036-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:25:36Z","timestamp":1558301136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37036-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370359","9783642370366"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37036-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}