Specification and Model Checking of the Chandy and Lamport Distributed Snapshot Algorithm in Rewriting Logic

Ogata, Kôichi; Huyen, Phan Thi Thanh

doi:10.1007/978-3-642-34281-3_9

Cited by 4 publications

(9 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, the snapshot algorithm is supposed to work while another process SYSTEM is working; SYSTEM is a model for another distributed system and the snapshot algorithm is an implementation of the observation of the current system. Contrary to the verification by theorem provers [18], our work provides an architecture for developing the snapshot algorithm using essential safety properties together with a formal proof that asserts its correctness. In this paper, we have experimented on fixed networks.…”

Section: Discussion Conclusion and Future Workmentioning

confidence: 99%

“…Another objective is to show the power of the correctby-construction process and our recipes through the redevelopment and derivation of already existing and correct snapshot algorithms like the Chandy and Lamport algorithm [9], or the algorithm of Lai and Yang [13]. Finally, the snapshot problem is already considered as a case study for illustrating the strength of rewriting logic [18] and we think that our development may help a reader to understand the behavioral theory of snapshot algorithms.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Revisiting Snapshot Algorithms by Refinement-Based Techniques

Andriamiarina

Méry²,

Singh³

2012

2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies

View full text Add to dashboard Cite

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.

show abstract

Section: Discussion Conclusion and Future Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Revisiting Snapshot Algorithms by Refinement-Based Techniques

Andriamiarina

Méry²,

Singh³

2012

2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies

View full text Add to dashboard Cite

show abstract

“…Several variants of CLDSA, such as Spezialetti-Kearns algorithm [14] and Venkatesans incremental snapshot algorithm [15], have been proposed. In an attempt to formally analyze CLDSA, the authors in [16] have used Maude [17] to model check that CLDSA enjoys the DSR property. Maude is a language and a system supporting executable specification and declarative programming in rewriting logic.…”

Section: Introductionmentioning

confidence: 99%

“…Two model checking facilities equipped with Maude are the LTL model checker and the search command. In [16], the Maude search command is used. However, the DSR property is encoded in terms of the Maude search command and the encoding does not reflect the informal description of the property originally given in [13].…”

Section: Introductionmentioning

confidence: 99%

A More Faithful Formal Definition of the Desired Property for Distributed Snapshot Algorithms to Model Check the Property

Doan

Ogata

2019

cai

Self Cite

View full text Add to dashboard Cite

The first distributed snapshot algorithm was invented by Chandy and Lamport: Chandy-Lamport distributed snapshot algorithm (CLDSA). Distributed snapshot algorithms are crucial components to make distributed systems fault tolerant. Such algorithms are extremely important because many modern key software systems are in the form of distributed systems and should be fault tolerant. There are at least two desired properties such algorithms should satisfy: 1) the distributed snapshot reachability property (called the DSR property) and 2) the ability to run concurrently with, but not alter, an underlying distributed system (UDS). This paper identifies subtle errors in a paper on formalization of the DSR property and shows how to correct them. We give a more faithful formal definition of the DSR property; the definition involves two state machines -one state machine M U DS that formalizes a UDS and the other M CLDSA that formalizes the UDS on which CLDSA is superimposed (UDS-CLDSA) -and can be used to more precise model checking of the DSR property for CLDSA. We also prove a theorem on equivalence of our new definition and an existing one that only involves M CLDSA to guarantee the validity of the existing model checking approach. Moreover, we prove the second property, namely that CLDSA does not alter the behaviors of UDS.

show abstract

“…There is an existing study [4] in which Maude [5] has been used to model check that CLDSA enjoys the DSR property. Maude is a specification and programming language and system based on rewriting logic, and equipped with model checking facilities: the LTL model checker and the search command.…”

Section: Introductionmentioning

confidence: 99%

Model Checking Chandy-Lamport Distributed Snapshot Algorithm Revisited

Doan

Zhang

et al. 2015

2015 2nd International Symposium on Dependable Computing and Internet of Things (DCIT)

Self Cite

View full text Add to dashboard Cite

Chandy and Lamport have proposed a distributed snapshot algorithm (called CLDSA). One desired property of CLDSA is as follows. Let s1 be the state in which CLDSA initiates, s2 be the state in which CLDSA terminates, and s * be the snapshot taken, and then s * is reachable from s1 and s2 is reachable from s * . The property is called the distributed snapshot reachability (DSR) property. We give a more faithful formal definition of the property that involves two state machines MUDS and CL(MUDS), where MUDS is a state machine of an underlying distributed system (UDS) and CL(MUDS) is a state machine of the UDS superimposed by CLDSA, while the definition of the DSR property used in an existing study only involves CL(MUDS). We also prove a theorem on equivalence of the two definitions that guarantees the validity of the model checking approach used in the existing study.

show abstract

Specification and Model Checking of the Chandy and Lamport Distributed Snapshot Algorithm in Rewriting Logic

Cited by 4 publications

References 7 publications

Revisiting Snapshot Algorithms by Refinement-Based Techniques

Revisiting Snapshot Algorithms by Refinement-Based Techniques

A More Faithful Formal Definition of the Desired Property for Distributed Snapshot Algorithms to Model Check the Property

Model Checking Chandy-Lamport Distributed Snapshot Algorithm Revisited

Contact Info

Product

Resources

About