In this paper, we apply a compositional proof technique to an automatic verification of the correctness of Fischer's mutual exclusion protocol. It is demonstrated that the technique may avoid the stateexplosion problem. Our compositional technique has recently been implemented in a tool CMC 5, which verifies the protocol for 50 processes within 172.3 seconds and using only 32MB main memory. In contrast all existing verification tools for timed systems will suffer from the stateexplosion problem, and no tool has to our knowledge succeeded in verifying the protocol for more than 11 processes.
A Compositional Proof of a Real-Time Mutual Exclusion Protocol
K. Kristoffersen,F. Laroussinie,K. Larsen,P. Pettersson,W. Yi
Published 1996 in Theory and Practice of Software Development
ABSTRACT
PUBLICATION RECORD
- Publication year
1996
- Venue
Theory and Practice of Software Development
- Publication date
1996-06-25
- Fields of study
Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-25 of 25 references · Page 1 of 1
CITED BY
Showing 1-66 of 66 citing papers · Page 1 of 1