Formal Verification of IA-64 Division Algorithms

The IA-64 architecture defers floating point and integer division to software. To ensure correctness and maximum efficiency, Intel provides a number of recommended algorithms which can be called as subroutines or inlined by compilers and assembly language programmers. All these algorithms have been subjected to formal verification using the HOL Light theorem prover. As well as improving our level of confidence in the algorithms, the formal verification process has led to a better understanding of the underlying theory, allowing some significant efficiency improvements.

• Type: Conference
• Year: 2000
• Where: TPHOL
• Authors: John Harrison
• Keywords: Automated Reasoning, Formal Verification, Formal Verification Process, HOL Light Theorem Prover, TPHOL 2000