Revisiting Snapshot Algorithms by Refinement-based Techniques (Extended Version) - Inria - Institut national de recherche en sciences et technologies du numérique
Article Dans Une Revue Computer Science and Information Systems Année : 2014

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

Résumé

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.

Dates et versions

hal-00924525 , version 1 (06-01-2014)

Identifiants

Citer

Manamiary Bruno Andriamiarina, Dominique Méry, Neeraj Kumar Singh. Revisiting Snapshot Algorithms by Refinement-based Techniques (Extended Version). Computer Science and Information Systems, 2014, Computer Science and Information System, 11 (1), pp.251-270. ⟨10.2298/CSIS130122007A⟩. ⟨hal-00924525⟩
279 Consultations
0 Téléchargements

Altmetric

Partager

More