Revisiting Snapshot Algorithms by Refinement-based Techniques - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Revisiting Snapshot Algorithms by Refinement-based Techniques

(1, 2) , (1) , (1)
1
2

Abstract

The snapshot problem addresses a collection of important algorithmic issues related to the distributed computations, which are used for debugging or recovering the distributed programs. Among the existing solutions, Chandy and Lamport propose 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 a correct distributed algorithm. Moreover, we demonstrate how this class of other distributed algorithms can be revisited. A consequence is to provide a fully mechanized proof of the distributed algorithms.
Fichier principal
Vignette du fichier
pdcat2012v14.pdf (273.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00734131 , version 1 (20-09-2012)

Identifiers

  • HAL Id : hal-00734131 , version 1

Cite

Manamiary Bruno Andriamiarina, Dominique Méry, Neeraj Kumar Singh. Revisiting Snapshot Algorithms by Refinement-based Techniques. PDCAT 2012 : The Thirteenth International Conference on Parallel and Distributed Computing, Applications and Technologies, Dec 2012, Beijing, China. ⟨hal-00734131⟩
365 View
515 Download

Share

Gmail Facebook Twitter LinkedIn More