Analyzing Mutable Checkpointing via Invariants

Abstract : The well-known coordinated snapshot algorithm of mutable checkpointing [7,8,9] is studied. We equip it with a concise formal model and analyze its operational behavior via an invariant characterizing the snapshot computation. By this we obtain a clear understanding of the intermediate behavior and a correctness proof of the final snapshot based on a strong notion of consistency (reachability within the partial order representing the underlying computation). The formal model further enables a comparison with the blocking queue algorithm [13] introduced for the same scenario and with the same objective.From a broader perspective, we advocate the use of formal semantics to formulate and prove correctness of distributed algorithms.
Type de document :
Communication dans un congrès
Mehdi Dastani; Marjan Sirjani. 6th Fundamentals of Software Engineering (FSEN), Apr 2015, Tehran, Iran. Springer, Lecture Notes in Computer Science, LNCS-9392, pp.176-190, 2015, Fundamentals of Software Engineering. 〈10.1007/978-3-319-24644-4_12〉
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01446599
Contributeur : Hal Ifip <>
Soumis le : jeudi 26 janvier 2017 - 10:43:27
Dernière modification le : jeudi 26 janvier 2017 - 10:57:19
Document(s) archivé(s) le : jeudi 27 avril 2017 - 14:55:28

Fichier

978-3-319-24644-4_12_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Deepanker Aggarwal, Astrid Kiehn. Analyzing Mutable Checkpointing via Invariants. Mehdi Dastani; Marjan Sirjani. 6th Fundamentals of Software Engineering (FSEN), Apr 2015, Tehran, Iran. Springer, Lecture Notes in Computer Science, LNCS-9392, pp.176-190, 2015, Fundamentals of Software Engineering. 〈10.1007/978-3-319-24644-4_12〉. 〈hal-01446599〉

Partager

Métriques

Consultations de la notice

52

Téléchargements de fichiers

16