Analyzing Mutable Checkpointing via Invariants - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Analyzing Mutable Checkpointing via Invariants


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.
Fichier principal
Vignette du fichier
978-3-319-24644-4_12_Chapter.pdf (335.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01446599 , version 1 (26-01-2017)





Deepanker Aggarwal, Astrid Kiehn. Analyzing Mutable Checkpointing via Invariants. 6th Fundamentals of Software Engineering (FSEN), Apr 2015, Tehran, Iran. pp.176-190, ⟨10.1007/978-3-319-24644-4_12⟩. ⟨hal-01446599⟩
59 View
85 Download



Gmail Facebook Twitter LinkedIn More