硬件验证的一般方法 FORMAL METHODS IN HARDWARE VERIFICATION.pptVIP

Formal Verification FORMAL METHODS IN HARDWARE VERIFICATION Overview Introduction What is verification (validation) Why do we need it Formal verification vs. simulation-based methods Math background Decision diagrams (BDD’s, BMD’s, etc.) Symbolic FSM traversal Formal methods model checking equivalence checking Semi-formal methods symbolic simulation functional validation Formal Methods Equivalence checking Combinational circuits Sequential circuits Model checking Problem statement Explicit algorithms (on graphs) Symbolic algorithms (using BDDs) Theorem proving Deductive reasoning Functional Testing Simulation-based methods Symbolic simulation Functional test generation SAT-based methods, Boolean SAT RTL verification: Arithmetic/Boolean SAT ATPG-based methods Emulation-based methods Hardware-assisted simulation System prototyping Part I INTRODUCTION Verification Design verification = ensuring correctness of the design against its implementation (at different levels) Why Verification Verification crisis System complexity, difficult to manage More time, effort devoted to verification than to actual design Need automated verification methods, integration Consequences Disasters, life threatening situations Inconvenience (Pentium bug … ?) Many more … Verification Methods Deductive verification Model checking Equivalence checking Simulation - performed on the model Emulation, prototyping – product + environment Testing - performed on the actual product (manufacturing test) Formal Verification Deductive reasoning (theorem proving) uses axioms, rules to prove system correctness no guarantee that it will terminate difficult, time consuming: for critical applications only Model checking automatic technique to prove correctness of concurrent systems: digital circuits, communication protocols, etc. Equivalence checking check if two circuits are equivalent OK for combinational circuits, unsolved for sequential Why Formal Verification Need for reliable hardware validatio