Revisiting Snapshot Algorithms by Refinement-Based Techniques

Andriamiarina, Manamiary Bruno; Méry, Dominique; Singh, Neeraj Kumar

doi:10.1109/pdcat.2012.119

Cited by 4 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nonetheless, the overall proof of a distributed algorithm is still largely manual and, when seeking confidence in this proof, an interactive proof assistant is the current approach. Several examples of verification of complex distributed algorithms exist: Chord with Alloy [39], Pastry with TLA + [30,29], Paxos also with TLA + [28], snapshot algorithms in Event-B [2], just to cite a few.…”

Section: Related Workmentioning

confidence: 99%

Tasks in Modular Proofs of Concurrent Algorithms

Castañeda¹,

Hurault

Quéinnec

et al. 2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Proving correctness of distributed or concurrent algorithms is a mind-challenging and complex process. Slight errors in the reasoning are difficult to find, calling for computer-checked proof systems. In order to build computer-checked proofs with usual tools, such as Coq or TLA + , having sequential specifications of all base objects that are used as building blocks in a given algorithm is a requisite to provide a modular proof built by composition. Alas, many concurrent objects do not have a sequential specification. This article describes a systematic method to transform any task, a specification method that captures concurrent one-shot distributed problems, into a sequential specification involving two calls, set and get. This transformation allows system designers to compose proofs, thus providing a framework for modular computer-checked proofs of algorithms designed using tasks and sequential objects as building blocks. The Moir&Anderson implementation of renaming using splitters is an iconic example of such algorithms designed by composition.

show abstract

Section: Related Workmentioning

confidence: 99%

Tasks in Modular Proofs of Concurrent Algorithms

Castañeda¹,

Hurault

Quéinnec

et al. 2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Integrating Proved State-Based Models for Constructing Correct Distributed Algorithms

Andriamiarina¹,

Méry²,

Singh³

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Modeling Chandy–Lamport Distributed Snapshot Algorithm Using Colored Petri Net

Pashazadeh,

Al-Basseer,

Tanha

2024

IET Software

View full text Add to dashboard Cite

Distributed global snapshot (DGS) is one of the fundamental protocols in distributed systems. It is used for different applications like collecting information from a distributed system and taking checkpoints for process rollback. The Chandy–Lamport protocol (CLP) is famous and well‐known for taking DGS. The main aim of this protocol was to generate consistent cuts without interrupting the regular operation of the distributed system. CLP was the origin of many future protocols and inspired them. The first aim of this paper is to propose a novel formal hierarchical parametric colored Petri net model of CLP. The number of constituting processes of the model is parametric. The second aim is to automatically generate a novel message sequence chart (MSC) to show detailed steps for each simulation run of the snapshot protocol. The third aim is model checking of the proposed formal model to verify the correctness of CLP and our proposed colored Petri net model. Having vital tools helps greatly to test the correct operation of the newly proposed distributed snapshot protocol. The proposed model of CLP can easily be used for visually testing the correct operation of the new future under‐development DGS protocol. It also permits formal verification of the correct operation of the new proposed protocol. This model can be used as a simple, powerful, and visual tool for the step‐by‐step run of the CLP, model checking, and teaching it to postgraduate students. The same approach applies to similar complicated distributed protocols.

show abstract

Revisiting Snapshot Algorithms by Refinement-Based Techniques

Cited by 4 publications

References 18 publications

Tasks in Modular Proofs of Concurrent Algorithms

Tasks in Modular Proofs of Concurrent Algorithms

Integrating Proved State-Based Models for Constructing Correct Distributed Algorithms

Modeling Chandy–Lamport Distributed Snapshot Algorithm Using Colored Petri Net

Contact Info

Product

Resources

About