Formally Modeling and Verifying Ricart & Agrawala Distributed Mutual Exclusion Algorithm

Authors:
K. Ogata;K. Futatsugi
Affiliations:
-;-
Venue:
APAQS '01 Proceedings of the Second Asia-Pacific Conference on Quality Software
Year:
2001

Citing 0
Cited 4

Modeling and Verification of Distributed Real-Time Systems Based on CafeOBJ

Proceedings of the 16th IEEE international conference on Automated software engineering
An Algebraic Framework for Modeling of Mobile Systems

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications

Journal of Symbolic Computation
Induction-guided falsification

ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the promising approaches to creating quality software is to formally model systems, describe the models ina formal specification language, and verify that the systems have some desirable properties based on the formaldocuments with an automatic model checker or an interactive theorem prover before the systems are implementedin a programming language. The more complicated thesystems are such as distributed systems, the more important the approach is. We have applied the approach toRicart&Agrawala distributed mutual exclusion algorithm.We have modeled the algorithm as a UNITY computationalmodel, described the model in CafeOBJ, and verified thatthe algorithm is actually mutually exclusive based on theCafeOBJ document with the help of the CafeOBJ system.