Revisiting Snapshot Algorithms by Refinement-based Techniques (Extended Version)

Abstract : The snapshot problem addresses a collection of important algorithmic issues related to distributed computations, which are used for debugging or recovering distributed programs. Among existing solutions, Chandy and Lamport have proposed a simple distributed algorithm. In this paper, we explore the correct-by-construction process to formalize the snapshot algorithms in distributed system. The formalization process is based on a modeling language Event B, which supports a refinement-based incremental development using RODIN platform. These refinement-based techniques help to derive correct distributed algorithms. Moreover, we demonstrate how other distributed algorithms can be revisited. A consequence is to provide a fully mechanized proof of the resulting distributed algorithms.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.inria.fr/hal-00924525
Contributor : Manamiary Bruno Andriamiarina <>
Submitted on : Monday, January 6, 2014 - 9:54:31 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:03 PM

Links full text

Identifiers

Collections

Citation

Manamiary Bruno Andriamiarina, Dominique Méry, Neeraj Kumar Singh. Revisiting Snapshot Algorithms by Refinement-based Techniques (Extended Version). Computer Science and Information Systems, ComSIS Consortium, 2014, Computer Science and Information System, 11 (1), pp.251-270. ⟨http://www.comsis.org/archive.php?show=pprpdcat1⟩. ⟨10.2298/CSIS130122007A⟩. ⟨hal-00924525⟩

Share

Metrics

Record views

420