In:
Formal Aspects of Computing, Association for Computing Machinery (ACM), Vol. 27, No. 1 ( 2015-01), p. 103-131
Kurzfassung:
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.
Materialart:
Online-Ressource
ISSN:
0934-5043
,
1433-299X
DOI:
10.1007/s00165-014-0303-1
Sprache:
Englisch
Verlag:
Association for Computing Machinery (ACM)
Publikationsdatum:
2015
ZDB Id:
1476364-3
