Formal verification at Intel

@article{Harrison2003FormalVA,
  title={Formal verification at Intel},
  author={J. Harrison},
  journal={18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.},
  year={2003},
  pages={45-54}
}
  • J. Harrison
  • Published 2003
  • 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… CONTINUE READING
    Combining model checking and theorem proving
    • 27
    Trustworthy numerical computation in Scala
    • 46
    • PDF
    Exploiting PSL standard assertions in a theorem-proving-based verification environment
    Solving quantified first order formulas in Satisfiability Modulo Theories
    Formal modeling for consistency checking of signal transition graph
    • 1
    MicroGP—An Evolutionary Assembly Program Generator
    • 59
    History of Interactive Theorem Proving
    On Rigorous Numerical Computation as a Scala Library

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 48 REFERENCES
    Symbolic Model Checking without BDDs
    • 2,356
    • PDF
    Divider Circuit Verification with Model Checking and Theorem Proving
    • 33
    Automatic verification of Pipelined Microprocessor Control
    • 490
    • PDF
    A Mizar Mode for HOL
    • 90
    • PDF
    Symbolic Simulation for Correct Machine Design
    • 58
    • PDF
    Program verification: the very idea
    • 268
    • PDF
    Proof Style
    • 44
    Symbolic Reachability Analysis Based on SAT-Solvers
    • 202
    • PDF