Causal-consistent rollback in a tuple-based language

Abstract : Rollback is a fundamental technique for ensuring reliability of systems, allowing one, in case of troubles, to recover a past system state. However, the definition of rollback in a concurrent/distributed scenario is quite tricky. We propose an approach based on the notion of causal-consistent reversibility: any given past action can be undone, provided that all the actions caused by it are undone as well. Given that, we define a rollback as the minimal causal-consistent sequence of backward steps able to undo a given action. We define the semantics of such a rollback operator, and show that it satisfies the above specification. The approach that we present is quite general, but we instantiate it in the case of µKlaim, a formal coordination language based on distributed tuple spaces. We remark that this is the first definition of causal-consistent rollback in a shared-memory setting. We illustrate the use of rollback in µKlaim on a simple, but realistic, application scenario.
Type de document :
Article dans une revue
Journal of Logical and Algebraic Methods in Programming, Elsevier, 2017, 88, pp.99 - 120. 〈10.1016/j.jlamp.2016.09.003〉
Liste complète des métadonnées

Littérature citée [35 références]  Voir  Masquer  Télécharger
Contributeur : Ivan Lanese <>
Soumis le : dimanche 12 novembre 2017 - 09:11:22
Dernière modification le : samedi 27 janvier 2018 - 01:31:49
Document(s) archivé(s) le : mardi 13 février 2018 - 12:49:25


Fichiers produits par l'(les) auteur(s)




Elena Giachino, Ivan Lanese, Claudio Antares Mezzina, Francesco Tiezzi. Causal-consistent rollback in a tuple-based language. Journal of Logical and Algebraic Methods in Programming, Elsevier, 2017, 88, pp.99 - 120. 〈10.1016/j.jlamp.2016.09.003〉. 〈hal-01633260〉



Consultations de la notice


Téléchargements de fichiers