Formally modeling and verifying Ricart & Agrawala distributed mutual exclusion algorithm

Proceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001

Volumn , Issue , 2001, Pages 357-366

  Ogata, Kazuhiro ^a   Futatsugi, Kokichi ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Algebraic specification; CafeOBJ; Distributed algorithms; Modeling; Specification; UNITY; Verification

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; FORMAL SPECIFICATION; MODELS; PARALLEL ALGORITHMS; SPECIFICATION LANGUAGES; SPECIFICATIONS; VERIFICATION;

ALGEBRAIC SPECIFICATIONS; AUTOMATIC MODELING; CAFEOBJ; COMPUTATIONAL MODEL; DISTRIBUTED MUTUAL EXCLUSION ALGORITHMS; DISTRIBUTED SYSTEMS; INTERACTIVE THEOREM PROVER; UNITY;

MODEL CHECKING;

EID: 0346537830     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APAQS.2001.990041     Document Type: Conference Paper

References (10)

1. CafeOBJ web page. http://www.ldl.jaist.ac.jp/cafeobj/.
2. K. M. Chandy and J. Misra. Parallel program design: a foundation. Addison-Wesley, Reading, MA, 1988.
3. R. Diaconescu and K. Futatsugi. CafeOBJ report. AMAST Series in Computing, 6. World Scientific, Singapore, 1998.
4. J. Goguen and G. Malcolm. A hidden agenda. Theoret. Cotnput. Sci., 24555-101, 2000.
5. L. Lamport. How to write a long formula. Reserach Report 119, Digital Equipment Corporation, System Research Center, 1993.
6. L. Lamport. The temporal logic of actions. ACM TOPLAS
7. N. A. Lynch. Distributed algorithms. Morgan-Kaufmann, San Francisco, CA, 1996.
8. Z. Manna and A. Pnueli. The temporal logic of reactive and concurrent system: specification. Springer-Verlag, NY, 1991.
9. Z. Manna and A. Pnueli. Temporal verification of reactive systems: safety. Springer-Verlag, NY, 1995.
10. G. Ricart and A. K. Agrawala. An optimal algorithm for mutual exclusion in computer networks. Comm. ACM, 24(1):9-17. 1981.