Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
Victor Carreño, The Transition Assertions Specification Method, University of Cambridge Computer Laboratory, Technical Report No. 279, January 1993.
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.
Leslie Lamport, A Fast Mutual Exclusion Algorithm ACM transactions on Computer Systems, Vol. 5 no. 1, February 1987, Pages 1–11.
Thomas Melham, Formalizing Abstraction Mechanisms for Hardware Verfication in Higher Oreder Logic, University of Cambridge Computer Laboratory, Technical Report No. 201, August 1990.
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.
N. Shankar, Mechanized Verification of Real-Time Systems Using PVS SRI International Computer Science Laaboratory Technical Report SRI-CSL-92-12, November 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carreño, V.A. (1994). Verification in higher order logic of mutual exclusion algorithm. In: Joyce, J.J., Seger, CJ.H. (eds) Higher Order Logic Theorem Proving and Its Applications. HUG 1993. Lecture Notes in Computer Science, vol 780. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57826-9_159
Download citation
DOI: https://doi.org/10.1007/3-540-57826-9_159
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57826-0
Online ISBN: 978-3-540-48346-5
eBook Packages: Springer Book Archive