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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer Science and Information Systems Ročník 11; číslo 1; s. 251 - 270
Hlavní autoři: Andriamiarina, Bruno, Méry, Dominique, Singh, Kumar
Médium: Journal Article
Jazyk:angličtina
Vydáno: ComSIS Consortium 2014
Edice:Computer Science and Information System
Témata:
Computer Science
Modeling and Simulation
refinement
correctness-by-construction
Distributed algorithms
verification
snapshot
ISSN:1820-0214, 2406-1018
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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