Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"boolean constraint propagation"”.

  1. Fast Static Learning and Inductive Reasoning with Applications to ATPG Problems

    … range of EDA applications. Techniques such as boolean constraint propagation for static learning and assume-then-verify approach to reason about inductive invariants have been possible due to efficient SAT solvers. Although a significant amount of research effort has been dedicated to the …

    vt Repository record for Fast Static Learning and Inductive Reasoning with Applications to ATPG Problems (opens in a new tab)

  2. Exploring Constraint Satisfiability Techniques in Formal Verification

    … due to the added cost in memory consumption and Boolean Constraint Propagation (BCP). We thus propose a novel double-layer conflict-driven learning to store only those "primary" conflict clauses back into the clause database while keeping the other clauses as pseudo Boolean constraints. With this …

    vt Repository record for Exploring Constraint Satisfiability Techniques in Formal Verification (opens in a new tab)

  3. Enhancing SAT-based Formal Verification Methods using Global Learning

    … the different variables, which enhances the Boolean Constraint Propagation (BCP). Experimental results on large and difficult ISCAS'85, ISCAS'89 (full scan) and ITC'99 (full scan) CEC instances and ISCAS'89 BMC instances show that our approach is independent of the state-of-the-art SAT-solver …

    vt Repository record for Enhancing SAT-based Formal Verification Methods using Global Learning (opens in a new tab)