## Structuring and Automating Hardware Proofs in a Higher-Order Theorem-Proving Environment (1993)

Venue: | Formal Methods in System Design |

Citations: | 20 - 7 self |

### BibTeX

@INPROCEEDINGS{Kumar93structuringand,

author = {Ramayya Kumar and Klaus Schneider and Thomas Kropf},

title = {Structuring and Automating Hardware Proofs in a Higher-Order Theorem-Proving Environment},

booktitle = {Formal Methods in System Design},

year = {1993},

pages = {165--230}

}

### OpenURL

### Abstract

. In this article we present a structured approach to formal hardware verification by modelling circuits at the register-transfer level using a restricted form of higher-order logic. This restricted form of higher-order logic is sufficient for obtaining succinct descriptions of hierarchically designed register-transfer circuits. By exploiting the structure of the underlying hardware proofs and limiting the form of descriptions used, we have attained nearly complete automation in proving the equivalences of the specifications and implementations. A hardware-specific tool called MEPHISTO converts the original goal into a set of simpler subgoals, which are then automatically solved by a general-purpose, first-order prover called FAUST. Furthermore, the complete verification framework is being integrated within a commercial VLSI CAD framework. Keywords: hardware verification, higher-order logic 1 Introduction The past decade has witnessed the spiralling of interest within the academic com...