Taylor Expansion Diagrams Home UMass Amherst泰勒展开图家居默斯特分校.pptVIP

TED TED-DATE02 Taylor Expansion Diagrams:A Compact Canonical Representationfor Symbolic Verification Outline Motivation – RTL verification Background BDD (binary), BMD (word-level) New canonical representation: TED Construction and manipulation Properties Applications Conclusions Limitations, future work Motivation – RTL Verification Complex RTL designs Data flow and control Arithmetic and Boolean Common Representations Boolean functions ( f : B ? B ) Truth table, Karnaugh map SoP, PoS, ESoP, Reed-Muller, etc. Binary Decision diagrams (BDD, ZDD, KFDD, …) Arithmetic functions ( f : B ? Int ) Binary Moment Diagrams (*BMD, K*BMD, …) Multi-terminal, Algebraic Decision Diagrams (ADD) Need more abstract representation for arithmetic functions (f : Int ? Int ) Binary Decision Diagrams (BDD) Based on recursive Shannon expansion: f = x fx + x’ fx’ where: fx = f(x=1), fx’=f(x=0) Compact data structure for Boolean logic Canonical representation reduced ordered BDDs (ROBDD) Essential for verification equivalence checking, satisfiability (SAT) Application to Verification Canonicity: equivalence checking of logic circuits Binary Moment Diagrams (BMD) Devised for word-level, arithmetic operations Based on modified Shannon expansion (pos. Davio) f = x fx + x’ fx’ = x fx + (1-x) fx’ = fx’ + x (fx - fx’ ) = fx’ + x f?x where fx’ = fx=0 is zero moment f? x = (fx - fx’ ) is first moment (derivative) BMD – Example Unsigned integer: X = 8x3 + 4x2 + 2x1 + x0 *BMD Efficiently models word-level operators Symbolic Representation Why expand words into bits? Can we do better? Abstract words into symbolic variables Taylor Expansion Diagram (TED) F = arithmetic function (F : Int ? Int ) Treat F as a continuous function Taylor Expansion (around x=0): F(x) = F(0) + x F’(0) + ? x2 F’’(0) + … Notation F0(x) = F(x=0) 0-child - - - - - - F1(x) = F’(x=0) 1-child ---------- F2(x) = ? F’’(x=0) 2-child ====== etc. Construction - Your First TED