{"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":1784206120019,"version":"3.55.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319994970","type":"print"},{"value":"9783319994987","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-99498-7_20","type":"book-chapter","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T04:45:39Z","timestamp":1534826739000},"page":"286-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Checkpoint\/Rollback vs Causally-Consistent Reversibility"],"prefix":"10.1007","author":[{"given":"Martin","family":"Vassor","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Bernard","family":"Stefani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,8,22]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-319-24644-4_12","volume-title":"Fundamentals of Software Engineering","author":"D Aggarwal","year":"2015","unstructured":"Aggarwal, D., Kiehn, A.: Analyzing mutable checkpointing via invariants. In: Dastani, M., Sirjani, M. (eds.) FSEN 2015. LNCS, vol. 9392, pp. 176\u2013190. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24644-4_12"},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1016\/S0304-3975(02)00566-2","volume":"290","author":"G Cao","year":"2003","unstructured":"Cao, G., Singhal, M.: Checkpointing with mutable checkpoints. Theor. Comput. Sci. 290(2), 1127\u20131148 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.tcs.2003.09.014","volume":"322","author":"T Chothia","year":"2004","unstructured":"Chothia, T., Duggan, D.: Abstractions for fault-tolerant global computing. Theor. Comput. Sci. 322(3), 567\u2013613 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Cristescu, I., Krivine, J., Varacca, D.: A compositional semantics for the reversible p-calculus. In: 28th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society (2013)","DOI":"10.1109\/LICS.2013.45"},{"key":"20_CR5","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. 3170, pp. 292\u2013307. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-28644-8_19"},{"key":"20_CR6","unstructured":"Elnozahy, E.N.: Manetho: fault-tolerance in distributed systems using rollback-recovery and process replication. Ph.D. thesis, Rice University, TX, USA (1993)"},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1145\/568522.568525","volume":"34","author":"EN Elnozahy","year":"2002","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. 34(3), 375\u2013408 (2002)","journal-title":"ACM Comput. Surv."},{"issue":"5","key":"20_CR8","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1109\/12.142678","volume":"41","author":"EN Elnozahy","year":"1992","unstructured":"Elnozahy, E.N., Zwaenepoel, W.: Manetho: transparent rollback-recovery with low overhead, limited rollback and fast output commit. IEEE Trans. Comput. 41(5), 526\u2013531 (1992)","journal-title":"IEEE Trans. Comput."},{"key":"20_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: 32nd ACM Symposium on the Principles of Programming Languages (POPL). ACM (2005)","DOI":"10.1145\/1040305.1040322"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.jlamp.2016.09.003","volume":"88","author":"E Giachino","year":"2017","unstructured":"Giachino, E., Lanese, I., Mezzina, C.A., Tiezzi, F.: Causal-consistent rollback in a tuple-based language. J. Log. Algebr. Methods Program. 88, 99\u2013120 (2017)","journal-title":"J. Log. Algebr. Methods Program."},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1109\/32.761450","volume":"25","author":"JM H\u00e9lary","year":"1999","unstructured":"H\u00e9lary, J.M., Netzer, R.H.B., Raynal, M.: Consistency issues in distributed checkpoints. IEEE Trans. Softw. Eng. 25(2), 274\u2013281 (1999)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-37036-6_21","volume-title":"Programming Languages and Systems","author":"I Lanese","year":"2013","unstructured":"Lanese, I., Lienhardt, M., Mezzina, C.A., Schmitt, A., Stefani, J.-B.: Concurrent flexible reversibility. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 370\u2013390. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-37036-6_21"},{"key":"20_CR13","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. 6269, pp. 478\u2013493. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15375-4_33"},{"key":"20_CR14","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. 6901, pp. 297\u2013311. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-23217-6_20"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2016.02.019","volume":"625","author":"I Lanese","year":"2016","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.-B.: Reversibility in the higher-order $$\\pi $$-calculus. Theor. Comput. Sci. 625, 25\u201384 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/5001.5005","volume":"8","author":"GB Leeman","year":"1986","unstructured":"Leeman, G.B.: A formal approach to undo operations in programming languages. ACM Trans. Program. Lang. Syst. 8(1), 50\u201387 (1986)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Automata, Languages and Programming","author":"R Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685\u2013695. Springer, Heidelberg (1992). \nhttps:\/\/doi.org\/10.1007\/3-540-55719-9_114"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-319-63139-4_15","volume-title":"Logic-Based Program Synthesis and Transformation","author":"N Nishida","year":"2017","unstructured":"Nishida, N., Palacios, A., Vidal, G.: A reversible semantics for Erlang. In: Hermenegildo, M.V., Lopez-Garcia, P. (eds.) LOPSTR 2016. LNCS, vol. 10184, pp. 259\u2013274. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63139-4_15"},{"issue":"2","key":"20_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10586-013-0277-4","volume":"17","author":"KS Perumalla","year":"2014","unstructured":"Perumalla, K.S., Park, A.J.: Reverse computation for rollback-based fault tolerance in large parallel systems - evaluating the potential gains and systems effects. Cluster Comput. 17(2), 303\u2013313 (2014)","journal-title":"Cluster Comput."},{"key":"20_CR20","unstructured":"Vassor, M., Stefani, J.B.: A comparison between stable causal log (Manetho) and a modified roll-pi calculus (2018). \nhttps:\/\/team.inria.fr\/spades\/long-version-checkpoint-vs-reversibility\/"},{"issue":"2","key":"20_CR21","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1017\/S0956796810000067","volume":"20","author":"L Ziarek","year":"2010","unstructured":"Ziarek, L., Jagannathan, S.: Lightweight checkpointing for concurrent ML. J. Funct. Program. 20(2), 137\u2013173 (2010)","journal-title":"J. Funct. Program."}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99498-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T04:56:40Z","timestamp":1534827400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99498-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319994970","9783319994987"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99498-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}