Abstract
This study explores the utility of reusing proven component invariants in the backward reachability-based sequential equivalence checking paradigm of formal verification. The authors present a formal method for simplifying the process of proving global invariants on an integrated design using the reachability information of the component state spaces, obtained from known invariants for the components of the design. Experimental results on benchmark circuits reveal that deriving the approximate reachability don't cares from the proofs of component invariants helps in reducing both the depth and breadth of the search.
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 callDisclaimer: 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.
