HOL light: A tutorial introduction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1166, Issue , 1996, Pages 265-269

  Harrison, John ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; DIGITAL ARITHMETIC; FORMAL METHODS; MODEL CHECKING; OPEN SYSTEMS;

FLOATING-POINT VERIFICATION; GENERAL SUPPORTS; HARDWARE VERIFICATION; HIGHER-ORDER MATCHING; HOL THEOREM PROVER; MATHEMATICAL THEORY; RECURSIVE DEFINITIONS; THEOREM PROVERS;

THEOREM PROVING;

EID: 84957700828     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0031814     Document Type: Conference Paper

References (12)

1. R. Boulton et al. Experience with embedding hardware description languages in HOL. In V. Stavridou, T. F. Melham, and R. T. Boute, editors, Proceedings of the IFIP TCIO/WG 10.of International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience, volume A-10 of IFIP Transactions A: Computer Science and Technology, pages 129-156, Nijmegen, The Netherlands, 1993. North-Holland.
2. M. J. C. Gordon. Why higher-order logic is a good formalism for specifying and verifying hardware. Technical Report 77, University of Cambridge Computer Laboratory, New Museums Site, Pembroke Street, Cambridge, CB2 3QG, UK, 1985.
3. M. J. C. Gordon. Mechanizing programming logics in higher order logic. In G. Birtwistle and P. A. Subrahmanyam, editors, Current Trends in Hardware Verification and Automated Theorem Proving, pages 387-439. Springer-Verlag, 1989.
4. M. J. C. Gordon, R. Milner, and C. P. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation, volume 78 of Lecture Notes in Computer Science. Springer- Verlag, 1979.
5. F. K. Hanna and N. Daeche. Specification and verification using higher-order logic: A case study. In G. Milne and P. A. Subrahmanyam, editors, Formal Aspects of VLSI Design: Proceedings of the 1985 Edinburgh Workshop on VLSI, pages 179-213, 1986.
6. IEEE. Standard for binary floating point arithmetic. ANSI/IEEE Standard 754-1985, The Institute of Electrical and Electronic Engineers, Inc., 345 East 47th Street, New York, NY 10017, USA, 1985.
7. S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In D. Kapur, editor, 11th International Conference on AutOmated Deduction, volume 607 of Lecture Notes in Computer Science, pages 748-752, Saratoga, NY, 1992. Springer-Verlag.
8. L. C. Paulson. Logic and computation: interactive proof with Cambridge LCF. Number 2 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1987.
9. L. C. Paulson. Isabelle: a generic theorem prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994. With contributions by Tobias Nipkow.
10. G. Stålmarck System for determining propositioaal logic theorems by applying values and rules to triplets that are generated from Boolean formula. United States Patent number 5,276,897; see also Swedish Patent 467 076, 1994.
11. A. Trybulec. The Mizar-QC/6000 logic information language. ALLC Bulletin (Association for Literary and Linguistic Computing), 6:136-140, 1978.
12. P. Weis and X. Leroy. Le langage Carol. InterEditions, 1993. See also the CAML Web page: http://pauillarinria.fr/caml/.