Abstract
HOL is a version of Robin Milner’s LCF theorem proving system for higher-order logic. It is currently being used to investigate (1) how various levels of hardware behaviour can be rigorously modelled and (2) how the resulting behavioral representations can be the basis for verification by mechanized formal proof. This paper starts with a tutorial introduction to the meta-language ML. The version of higher-order logic implemented in the HOL system is then described. This is followed by an introduction to goal-directed proof with tactics and tacticals. Finally, there is a little example of the system in action which illustrates how HOL can be used for hardware verification.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. J. Camilleri, T. F. Melham and M. J. C. Gordon, Hardware Verification Using Higher-Order Logic, University of Cambridge Computer Laboratory, Technical Report No. 91, 1986.
A. Church, A Formulation of the Simple Theory of Types, Journal of Symbolic Logic 5, 1940.
A. J. Cohn, A Proof of Correctness of the Viper Microprocessor: The First Level. In: VLSI Specification, Verification and Synthesis, edited by G. Birtwistle and P.A. Subrahmanyam (this volume).
G. Cousineau, G. Huet and L. Paulson, The ML Handbook, INRIA, 1986.
M. Gordon, R. Milner, L. Morris, M. Newey and C. Wadsworth, A Metalanhuage for Interactive proof in LCF, Fifth ACM SIGACT-3IGPLAN Conference on Principles of Programming Languages, Tucson, Arizona, 1978.
M. Gordon, R. Milner and C. P. Wadsworth, Edinburgh LCF: A Mechanised Logic of Computation, Lecture Notes in Computer Science, SpringerVerlag, 1979.
M. Gordon, HOL: A Machine Oriented Formulation of Higher-Order Logic, University of Cambridge Computer Laboratory, Technical Report No. 68, 1985.
M. Gordon, Why Higher-order Logic is a Good Formalism for Specifying and Verifying Hardware. In: Formal Aspects of VLSI Design, edited by G. Milne and P. A. Subrahmanyam, North-Holland, 1986.
F. K. Hanna and N. Daeche, Specification and Verification Using HigherOrder Logic. In: Formal Aspects of VLSI Design, edited by G. Milne and P. A. Subrahmanyam, North-Holland, 1986.
J. Herbert, Ph.D. Thesis, University of Cambridge, to appear 1987.
J. J. Joyce, Verification and Implementation of a Microprocessor, In: VLSI Specification, Verification and Synthesis, edited by G. Birtwistle and P.A. Subrahmanyam (this volume).
A. Leisenring, Mathematical Logic and Hilbert’s ∊-Symbol, Macdonaldk Co. Ltd., London, 1969.
T. Melham, Ph.D. Thesis, University of Cambridge, to appear.
R. Milner, Implementation and Application of Scott’s Logic for Computable Functions, Proceedings of the ACM Conference on Proving Assertions about Programs, SIGPLAN notices 7,1, 1972.
R. Milner, A Theory of Type Polymorphism in Programming, Journal of Computer and System Sciences, 17, 1978.
R. Milner, A Proposal for Standard ML, Proceedings of the 1984 ACM Symposium on LISP and Functional Programming, Austin, Texas, 1984.
L. Paulson, A Higher-Order Implementation of Rewriting, Science of Computer Programming 3, 119–149,1983.
L. Paulson, Logic and Computation, Cambridge University Press, to Appear, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Kluwer Academic Publishers, Boston
About this chapter
Cite this chapter
Gordon, M.J.C. (1988). HOL: A Proof Generating System for Higher-Order Logic. In: Birtwistle, G., Subrahmanyam, P.A. (eds) VLSI Specification, Verification and Synthesis. The Kluwer International Series in Engineering and Computer Science, vol 35. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-2007-4_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-2007-4_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9197-8
Online ISBN: 978-1-4613-2007-4
eBook Packages: Springer Book Archive