Formal verification at Intel

@article{Harrison2003FormalVA,
  title={Formal verification at Intel},
  author={John Harrison},
  journal={18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.},
  year={2003},
  pages={45-54}
}
  • J. Harrison
  • Published 2003
  • Mathematics, Computer Science
  • 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
As designs become more complex, formal verification techniques are becoming increasingly important in the hardware industry. Many different methods are used, ranging from propositional tautology checking up to use of interactive higher-order theorem provers. Our own work is mainly concerned with the formal verification of floating-point mathematical functions. As this paper illustrates, such applications require a rather general mathematical framework and the ability to automate special-purpose… Expand
Formal Verification of n-bit ALU Using Theorem Proving
TLDR
This project recently proposed a higher-order-logic formalization of all the commonly used combinational circuits, like basic gates, adders, multiplier, multiplexers, demultiplexer, decoders and encoders, using the HOL4 theorem prover, and describes this formally verified library. Expand
Exploiting PSL standard assertions in a theorem-proving-based verification environment
TLDR
This paper presents the work on development of the semi-automated theorem-proving based verification system ROVERIFIC that makes use of existing design assertions, and defines generic predicate templates that capture the semantics of PSL, and a subset of Verilog. Expand
Towards Strong Higher-Order Automation for Fast Interactive Verification
TLDR
The Matryoshka project aims to enrich superposition and SMT with higher-order reasoning in a careful manner, to preserve their good properties and bring a new level of automation to the users of proof assistants. Expand
Combining model checking and theorem proving
We implement a model checker for the modal mu-calculus as a derived rule in a fully expansive mechanical theorem prover, without causing an unacceptable performance penalty. We use a restricted formExpand
Solving quantified first order formulas in Satisfiability Modulo Theories
Design errors in computer systems, i.e. bugs, can cause inconvenience, loss of data and time, and in some cases catastrophic damages. One approach for improving design correctness is formal methods:Expand
Trustworthy numerical computation in Scala
TLDR
This work presents a library solution for rigorous arithmetic computation that tracks a (double) floating point value, but also a guaranteed upper bound on the error between this value and the ideal value that would be computed in the real-value semantics. Expand
Formal modeling for consistency checking of signal transition graph
TLDR
The formal modeling scheme of a signal transition graph is proposed along with the consistency property in term of the linear temporal formula and the result shows that the method can verify consistency property automatically. Expand
History of Interactive Theorem Proving
Interactive Theorem Proving today provides powerful tools for proving, certifying and for helping mathematicians. The development relies on a evolutionary process from simple tools 50 years ago toExpand
On Rigorous Numerical Computation as a Scala Library
TLDR
This work presents a library solution for rigorous arithmetic computation that seamlessly integrates into the Scala programming language, thanks to its extensibility mechanisms such as implicit conversions and the treatment of arithmetic operations as method calls. Expand
On the Design and Implementation of SmartFloat and AffineFloat
TLDR
This work presents a library solution for rigorous arithmetic computation that tracks a (double) floating point value, but also a guaranteed upper bound on the error between this value and the ideal value that would be computed in the real-value semantics. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 48 REFERENCES
Divider Circuit Verification with Model Checking and Theorem Proving
TLDR
This paper discusses a formal verification case study based on a combination of theorem-proving and model-checking techniques that addresses the correctness of a floating-point divider unit of an Intel IA-32 microprocessor. Expand
Superscalar Processor Verification Using Efficient Reductions of the Logic of Equality with Uninterpreted Functions to Propositional Logic
TLDR
This work achieves a significant speedup in the verification of dual-issue superscalar processors, compared to the result by Burch and Dill, while using an entirely automatic tool. Expand
Symbolic Simulation for Correct Machine Design
TLDR
Symbolic simulation is described, a method similar to symbolic execution of programs, and its use in proving the correctness of machine architectures implemented in microcode. Expand
A Mizar Mode for HOL
TLDR
The addition of another style of HOL proofs, inspired by Mizar, is described, which is believed to combine the secure extensibility and interactivity of HOL with Mizar’s readability and lack of logical prescriptiveness. Expand
Proof Style
TLDR
This talk discusses the strengths and weaknesses of declarative and procedural styles for proofs in pure mathematics and for veriication applications, and explores the bias towards a `procedural' or`declarative' proof style. Expand
Automatic verification of Pipelined Microprocessor Control
TLDR
The method handles more complicated designs, and requires less human intervention, than existing methods, and results from an efficient validity checker for a logic of uninterpreted functions with equality. Expand
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
TLDR
Positive equality allows us to overcome the experimental blow-up experienced previously when verifying microprocessors with load, store, and branch instructions and two methods to translate formulas in EUF into propositional logic are presented. Expand
Efficiency in a fully-expansive theorem prover
TLDR
This thesis seeks to identify sources of non-inherent ine ciency in the HOL system and proposes some general-purpose and some specialised techniques for eliminating it and a framework in which part of the computation involved in HOL proofs can be postponed to enable users to make better use of their time. Expand
Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving
TLDR
This work has constructed a system that seamlessly integrates symbolic trajectory evaluation based model checking with theorem proving in a higher-order classical logic by using the same programming language as both the meta and object language of theorem proving. Expand
Symbolic Model Checking without BDDs
TLDR
This paper shows how boolean decision procedures, like Stalmarck's Method or the Davis & Putnam Procedure, can replace BDDs, and introduces a bounded model checking procedure for LTL which reduces model checking to propositional satisfiability. Expand
...
1
2
3
4
5
...