Fast Static Learning and Inductive Reasoning with Applications to ATPG Problems
Relations among various nodes in the circuit, as captured by static and inductive invariants, have shown to have a positive impact on a wide range of EDA applications. Techniques such as boolean constraint propagation for static learning and assume-then-verify approach to reason about inductive inva...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
Virginia Tech
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10919/51591 |