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.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Hierarchical Tracking by Reinforcement Learning-Based Searching and Coarse-to-Fine Verifying ABSTRACT: A class-agnostic tracker typically has three main components, namely its motion model, its target appearance
PROJECT TITLE :Physical Attestation in the Smart Grid for Distributed State Verification - 2018ABSTRACT:A malicious process in a very distributed system can fabricate its internal state in its communications with its peers. These
PROJECT TITLE :Catch You if You Misbehave: Ranked Keyword Search Results Verification in Cloud Computing - 2018ABSTRACT:With the arrival of cloud computing, a lot of and additional individuals tend to outsource their knowledge
PROJECT TITLE :A Structured Visual approach to GALS Modelling and Verification of Communication Circuits - 2017ABSTRACT:During this paper, a completely unique globally asynchronous regionally synchronous (GALS) modeling and verification
PROJECT TITLE :A Structured Visual approach to GALS Modellingand Verification of Communication Circuits - 2017ABSTRACT:During this paper, a unique globally asynchronous domestically synchronous (GALS) modeling and verification

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry