Formal verification of a DSP chip using an iterative approach

In this paper we describe a methodology for the formal verification of a DSP chip using the HOL theorem proven We used an iterative method to specify both the behavioral and structural descriptions of the processor. Our methodology consists of first simplifying the representations of the DSP units. We then prove for each unit that its hardware description implies its behavioral specification. Using the simplified (abstracted) description of the units we have been able to greatly reduce the cost of deducing the behavior of the processor instruction set from the hardware implementation of the processor units. The proposed methodology creates a new representation of the processor at each iteration such that its complexity can be handled by the theorem proven. This allowed us to make a proof of the full instruction set of this processor.