Cart (Loading....) | Create Account
Close category search window

Formally modeling and verifying Ricart&Agrawala distributed mutual exclusion algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Ogata, K. ; Graduate Sch. of Inf. Sci., JAIST, Ishikawa, Japan ; Futatsugi, K.

One of the promising approaches to creating quality software is to formally model systems, describe the models in a formal specification language, and verify that the systems have some desirable properties based on the formal documents with an automatic model checker or an interactive theorem prover before the systems are implemented in a programming language. The more complicated the systems are, such as distributed systems, the more important the approach is. We have applied the approach to the Ricart&Agrawala distributed mutual exclusion algorithm (G. Ricart and A. K. Agrawala, 1981). We have modeled the algorithm as a UNITY computational model, described the model in CafeOBJ, and verified that the algorithm is actually mutually exclusive based on the CafeOBJ document with the help of the CafeOBJ system

Published in:

Quality Software, 2001. Proceedings.Second Asia-Pacific Conference on

Date of Conference:


Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.