Formal verification of IA-64 division algorithms (2000)
| Venue: | Proceedings, Theorem Proving in Higher Order Logics (TPHOLs), LNCS 1869 |
| Citations: | 15 - 4 self |
BibTeX
@INPROCEEDINGS{Harrison00formalverification,
author = {John Harrison},
title = {Formal verification of IA-64 division algorithms},
booktitle = {Proceedings, Theorem Proving in Higher Order Logics (TPHOLs), LNCS 1869},
year = {2000},
pages = {234--251},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. 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. 1
