A Compositional Proof of a Real-Time Mutual Exclusion Protocol

Kåre J. Kristoffersen (1) , François Laroussinie (2) , Kim Guldstrand Larsen (1) , Paul Pettersson (3) , Wang Yi (3)

1 CISS - Center for Indlejrede Software Systemer
2 LSV - Laboratoire Spécification et Vérification [Cachan]
3 DIT-UPPSALA - Department of Information Technology

In this paper, we apply a compositional proof technique to an automatic veri cation of the correctness of Fischer's mutual exclusion protocol. It is demonstrated that the technique may avoid the state{ explosion problem. Our compositional technique has recently been im- plemented in a tool CMC5, which veri es the protocol for 50 processes within 172.3 seconds and using only 32MB main memory. In contrast all existing veri cation tools for timed systems will su er from the state{ explosion problem, and no tool has to our knowledge succeeded in veri- fying the protocol for more than 11 processes.

Domaines: Logique en informatique [cs.LO]; Théorie et langage formel [cs.FL]

Kåre J. Kristoffersen, François Laroussinie, Kim Guldstrand Larsen, Paul Pettersson, Wang Yi. A Compositional Proof of a Real-Time Mutual Exclusion Protocol. Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development (TAPSOFT'97), 1997, Lille, France. pp.565-579, ⟨10.1007/BFb0030626⟩. ⟨hal-00904842⟩