Abstract

Efficient decision procedures based on binary decision diagrams (BDDs) have recently been developed for formal verification of hardware. A novel application of these procedures is presented. An algorithm is described for deciding whether a gate-level design satisfies a finite state machine specification. The unique feature of this method is that it does not require knowing the state encoding and, in fact, derives the encoding from the specification and a net-list description of the design. This algorithm is related to the algorithms that implement a computational theory of sequential hardware equivalence, as realized in the MCC-CAD sequential equivalence tool (SET). This theory of sequential hardware equivalence does not require knowledge of an initial state of the design. >

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.