Verification in higher order logic of mutual exclusion algorithm
In this work a mutual exclusion algorithm is modeled using Transition Assertions. The main feature of a mutual exclusion algorithm is to prevent simultaneous access of a shared resource by two or more systems. The specification of the algorithm is a collection of transition assertions with each transition assertion containing a precondition and postcondition. The Transition Assertions model is formalized in higher order logic and the HOL mechanized theorem prover is used to show that the Transition Assertions model complies with the mutual exclusion requirement.
Unable to display preview. Download preview PDF.
- 1.Martin Abadi and Leslie Lamport, An Old-Fashioned Recipe for Real Time, in proceedings 1991 Rex Workshop, Real-time: Theory in Practice, J.W. de Bakker et al., editors, Springer-Verlag, 1992.Google Scholar
- 2.Victor Carreño, The Transition Assertions Specification Method, University of Cambridge Computer Laboratory, Technical Report No. 279, January 1993.Google Scholar
- 3.Avra Cohen, Correctness Properties of the Viper Microprocessor: The Second Level, in: Current Trends in Hardware Verification and Automated Theorem Proving, edited by G. Birtwistle and P.A. Subrahmanyam, Springer-Verlag, 1989, Pages 1–91.Google Scholar
- 4.Leslie Lamport, A Fast Mutual Exclusion Algorithm ACM transactions on Computer Systems, Vol. 5 no. 1, February 1987, Pages 1–11.Google Scholar
- 5.Thomas Melham, Formalizing Abstraction Mechanisms for Hardware Verfication in Higher Oreder Logic, University of Cambridge Computer Laboratory, Technical Report No. 201, August 1990.Google Scholar
- 6.Fred Schneider, Bard Bloom, and Keith Marzullo, Putting Time Into Proof Outlines Cornell University, Department of Computer Science Technical Report TR 91-1238, September 1991.Google Scholar
- 7.N. Shankar, Mechanized Verification of Real-Time Systems Using PVS SRI International Computer Science Laaboratory Technical Report SRI-CSL-92-12, November 1992.Google Scholar