Formal Verification of the MCS List-Based Queuing Lock

Authors:
Kazuhiro Ogata;Kokichi Futatsugi
Affiliations:
-;-
Venue:
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Year:
1999

Citing 4
Cited 2

Parallel program design: a foundation

Parallel program design: a foundation
Algorithms for scalable synchronization on shared-memory multiprocessors

ACM Transactions on Computer Systems (TOCS)
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Distributed Algorithms

Distributed Algorithms

Specifying and verifying a railroad crossing with CafeOBJ

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Modeling and Verification of Distributed Real-Time Systems Based on CafeOBJ

Proceedings of the 16th IEEE international conference on Automated software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have formally verified the MCS list-based queuing lock algorithm (MCS) with CafeOBJ and UNITY. What we have shown is that it has the two properties that more than one process can never enter their critical section simultaneously and a process wanting to enter a critical section eventually enters there. First a simple queuing lock algorithm (MCS0) has been specified in CafeOBJ by adopting UNITY computational model, and verified with UNITY logic. Secondly a queuing lock algorithm (MCS1) specified in the same way as MCS0 has been verified by showing the existence of a simulation relation from MCS1 to MCS0 with the help of CafeOBJ. Lastly MCS has been derived from a slightly modified MCS1.