Verifying Arithmetic Hardware in Higher-Order Logic
BibTeX
@MISC{_verifyingarithmetic,
author = {},
title = {Verifying Arithmetic Hardware in Higher-Order Logic},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract- Theorem-based design uses logical inference rather than simulation to determine or verify the proper-ties of design implementations. The initial effort to make such an approach practical is large when com-pared to conventional simulation. However, the cost of this effort is typically incurred only once. The hardware descriptions are parameterized so that the verification results are applicable to an entire set of designs rather than just one instantiation. To illustrate these ideas, the logical structure used to verify arithmetic hardware in HOL is outlined. In particular, the role of data abstrac-tion, recursion, and induction is shown. 1.
Citations
| 481 | No silver bullet: Essence and accidents of software engineering - Brooks - 1987 |
| 196 | HOL: A Proof Generating System for Higher-Order Logic - Gordon - 1988 |
| 16 | Advanced functional programming - Hughes - 2005 |
| 1 | Verified Synthesis Fiunctions for Negabinary Arithmetic Hardware - Chin - 1989 |
| 1 | Synthesis of Arithmetic Hardware Using Hardware Metafunctions - Chin - 1990 |
