Formal verification of data-path circuits based on symbolic simulation

DOI

Description

This paper presents a formal verification method based on logic simulation. In our method, using symbolic values even circuits which include data paths can be verified without abstraction of data paths. Our verifier extracts a transition relation from the state graph (given as a specification) which is expressed using symbolic values, and verifies based on simulation using those symbolic values if the circuit behaves correctly with respect to each transition of the specification. If the verifier terminates with "correct", then we can guarantee that for any applicable input vector sequences, the circuit and the specification behaves identically. We implemented the proposed method on a Unix workstation and verified some FIFO and LIFO circuits by using it.

Journal

Details 詳細情報について

Report a problem

Back to top