Invariant-Free Formal Verification of Pipelined and Superscalar Controls by Behavior-Covering and Partial Unfolding

摘要

This paper describes an algorithm and its pro- totype system-VeriProc/1.1-which can prove the correctness of pipelined and superscalar processor controls automatically with- out a pipeline invariant, human interaction, or additional infor- mation. This algorithm is based on behavior-covering and partial unfolding. No timing relations such as an abstract function or β- relation is required. The only information required is to specify the location of the selectors in the design. Partial unfolding makes it possible to derive superscalar specifications from conventional specifications. Correctness proof of the partial unfolding is given. The prototype system can verify various superscalar control de- signs of simple processors.