Abstract
We describe the use of the HOL system to corroborate the logical consistency of Noden, an integrated HDL and proof system. The Noden logic is interpreted by representing terms of the logic (which are terms of the Noden HDL) as logical statements in the HOL logic. We describe the datatypes representing types and values, and sample the representation of built-in operations, functions and macros as HOL function specifications. An interpretation of Noden truth-valued statements is presented as a translation of these to HOL sequents, and the representation of Noden proof operations as HOL conversions. Results of the work are summarised, including exposed errors and ambiguities of the Noden logic and implementation. We conclude that this approach to providing assurance of soundness and consistency of a less secure proof system is not only useful, but is a practical method of prototyping and an aid to specifying such a system.
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.
Preview
Unable to display preview. Download preview PDF.
References
P.B. Andrews. An Introduction to Mathematical Logic and Type Theory: to Truth through Proof. Computer Science and Applied Mathematics Series. Academic Press, 1986.
Richard J. Boulton. A HOL Semantics for a Subset of ELLA. Technical Report No. 254, University of Cambridge, Computer Laboratory, 1992.
William M. Farmer. Theory interpretation in simple type theory. In Karl Meinke, editor, Proceedings of the International Workshop on Higher Order Algebra, Logic and Term Rewriting, 1993.
William M. Farmer, March 1994. Personal communication.
M. J. C. Gordon and T. F. Melham. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.
B. Graham. Soundness of theorem proving methods for hardware verification Report 1. Unpublished progress report, December 1993.
John Harrison. Hardware Verification with the HOL-ELLA system. Unpublished draft report on the HOL-ELLA system, 1993.
A.M. Pitts. The HOL logic. In M.J.C. Gordon and T.F. Melham, editors, Introduction to HOL: A theorem proving environment for higher order logic, chapter 15–16, pages 191–232. Cambridge University Press, 1993.
Clive Pygott. A prover for NODEN. Technical report, CSE3, DRA Malvern, August 1992.
Clive Pygott. A window based prover for a hadware description language. Mod Report Number DRA/CIS/CSE3/B36AK/93002/1.0, CSE3, DRA Malvern, November 1993.
Clive Pygott. Final report for “formal mehtods for hardware design”. Mod Report Number DRA/CIS/CSE3/B36AK/94001/1.0, CSE3, DRA Malvern, April 1994.
J. von Wright. Representing higher-order logic proofs in hol. Draft report, September 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Graham, B.T. (1994). An interpretation of Noden in HOL. In: Melham, T.F., Camilleri, J. (eds) Higher Order Logic Theorem Proving and Its Applications. HUG 1994. Lecture Notes in Computer Science, vol 859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58450-1_45
Download citation
DOI: https://doi.org/10.1007/3-540-58450-1_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58450-6
Online ISBN: 978-3-540-48803-3
eBook Packages: Springer Book Archive