Formal verification at Intel
Author:
- J. HarrisonJHJ. Harrison
- 22 December 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 45-54
Abstract
As designs become more complex, formal verificationtechniques are becoming increasingly important in thehardware industry. Many different methods are used, rangingfrom propositional tautology checking up to the use ofinteractive higher-order theorem provers. Our own work ismainly concerned with the formal verification of floating-pointmathematical functions. As this paper aims to illustrate,such applications require a rather general mathematicalframework and the ability to automate special-purposeproof algorithms in a reliable way. Our work uses thepublic-domain interactive theorem prover HOL Light, andwe claim that this and similar LCF-style' theorem proversare a good choice for such applications.Keywords
This publication has 29 references indexed in Scilit:
- Isolating critical cases for reciprocals using integer factorization2004
- Software Reliability Methods2001
- Automated Theorem Proving in Software Engineering2001
- A Skeptic's Approach to Combining HOL and MapleJournal of Automated Reasoning, 1998
- Theorem Proving with the Real Numbers1998
- Formal verification by symbolic evaluation of partially-ordered trajectoriesFormal Methods in System Design, 1995
- An integration of model checking with automated proof checking1995
- Anatomy of the Pentium bug1995
- Computation of elementary functions on the IBM RISC System/6000 processorIBM Journal of Research and Development, 1990
- Every Prime Has a Succinct CertificateSIAM Journal on Computing, 1975