Verification of distributed systems with the axiomatic system of MSVL

Since distributed systems are inherently concurrent and asynchronous, it is a challenge for us to verify distributed systems. MSVL is a useful temporal logic programming language and its axiomatic system has been established. However, the axiomatic system of MSVL lacks mechanisms to manage asynchron...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Formal aspects of computing Jg. 27; H. 1; S. 103 - 131
Hauptverfasser: Ma, Qian, Duan, Zhenhua, Zhang, Nan, Wang, Xiaobing
Format: Journal Article
Sprache:Englisch
Veröffentlicht: London Springer London 01.01.2015
Association for Computing Machinery
Schlagworte:
Algorithms
Axioms
Communication systems
Completeness
Computation
Computer networks
Computer Science
Math Applications in Computer Science
Original Article
Programming languages
Temporal logic
Theory of Computation
MSVL
Temporal logic programming
Distributed systems
Theorem proving
Temporal logic
ISSN:0934-5043, 1433-299X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Since distributed systems are inherently concurrent and asynchronous, it is a challenge for us to verify distributed systems. MSVL is a useful temporal logic programming language and its axiomatic system has been established. However, the axiomatic system of MSVL lacks mechanisms to manage asynchronous communication, which makes it cannot deal with distributed systems. Thus, to verify distributed systems with MSVL in a deductive way, this paper is motivated to extend the axiomatic system of MSVL with new axioms for asynchronous communication. To this end, firstly we formalize state axioms regarding asynchronous communication commands and then prove the soundness and completeness. Further, to demonstrate how the extended axiomatic system of MSVL works for distributed systems, we apply it to the well-known Ricart–Agrawala (RA) algorithm, which is a distributed mutual exclusion algorithm and has an infinite state space. To do this, we model the RA algorithm with MSVL, specify the desired properties and then verify an instance of the RA algorithm with respect to the first-come-first-served property.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0934-5043
1433-299X
DOI:10.1007/s00165-014-0303-1