Specifying a Distributed Snapshot Algorithm as a Meta-Program and Model Checking it at Meta-Level

The paper proposes a new approach to model checking Chandy-Lamport Distributed Snapshot Algorithm (CLDSA). The essential of the approach is that CLDSA is specified as a meta-program in Maude such that the meta-program takes a specification of an underlying distributed system (UDS) and generates the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the International Conference on Distributed Computing Systems S. 1586 - 1596
Hauptverfasser: Thu Doan, Ha Thi, Ogata, Kazuhiro, Bonnet, Francois
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.06.2017
Schlagworte:
Computational modeling
Conferences
Distributed algorithms
Distributed computing
distributed snapshot algorithm
Electronic mail
meta-programming
Model checking
reachability
Reliability
system specification
ISSN:1063-6927
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The paper proposes a new approach to model checking Chandy-Lamport Distributed Snapshot Algorithm (CLDSA). The essential of the approach is that CLDSA is specified as a meta-program in Maude such that the meta-program takes a specification of an underlying distributed system (UDS) and generates the specification of the UDS on which CLDSA is superimposed (UDS-CLDSA). To model check that a UDS-CLDSA enjoys a desired property, it suffices that human users specify the UDS for the proposed approach, while human users need to specify the UDS-CLDSA for the existing approach for each UDS. Since the proposed approach conducts model checking at meta-level, it produces a counterexample if a UDS-CLDSA does not enjoy the property, while the existing approach does not. Our method specifying CLDSA as a meta-program can be applied to formal specification of the class of distributed algorithms that are superimposed on UDSs.
ISSN:1063-6927
DOI:10.1109/ICDCS.2017.176