Abstract
The verification of a bit-slice ALU has been accomplished using a mechanical theorem prover. This ALU has an n-bit design Slx~ification, which has been verified to implement its top-level specification. The ALU and top-level specifications were written in the Boyer-Moore logic. The verification was carried out with the aid of Boyer-Moore theorem prover in a hierarchical fashion.
Cite
CITATION STYLE
Hunt, W. A., & Brock, B. C. (1990). The verification of a bit-slice ALU. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 408 LNCS, pp. 282–306). Springer Verlag. https://doi.org/10.1007/0-387-97226-9_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
