Revisiting snapshot algorithms by refinement-based techniques

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 c...

Full description

Saved in:
Bibliographic Details
Published in:Computer Science and Information Systems Vol. 11; no. 1; pp. 251 - 270
Main Authors: Andriamiarina, Bruno, Méry, Dominique, Singh, Kumar
Format: Journal Article
Language:English
Published: ComSIS Consortium 2014
Series:Computer Science and Information System
Subjects:
Computer Science
Modeling and Simulation
refinement
correctness-by-construction
Distributed algorithms
verification
snapshot
ISSN:1820-0214, 2406-1018
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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-byconstruction 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. nema
ISSN:1820-0214
2406-1018
DOI:10.2298/CSIS130122007A