ATPG-based Preimage Computation: Efficient search space pruning with ZBDD
K Chandrasekar, MS Hsiao - Eighth IEEE International High …, 2003 - ieeexplore.ieee.org
Computing image/preimage is a fundamental step in formal verification of hardware
systems. Conventional OBDD-based methods for formal verification suffer from spatial …
systems. Conventional OBDD-based methods for formal verification suffer from spatial …
Decision selection and learning for an'all-solutions ATPG engine'
K Chandrasekar, MS Hsiao - 2004 International Conferce on …, 2004 - ieeexplore.ieee.org
'All-solutions ATPG'based methods have found applications in model checking sequential
circuits, and they can also improve the defect coverage of a test-suite, by generating distinct …
circuits, and they can also improve the defect coverage of a test-suite, by generating distinct …
Search-space aware learning techniques for unbounded model checking and path delay testing
K Chandrasekar - 2006 - vtechworks.lib.vt.edu
The increasing complexity of VLSI designs, in recent years, poses serious challenges while
ensuring the correctness of large designs for functionality and timing. In this dissertation, we …
ensuring the correctness of large designs for functionality and timing. In this dissertation, we …
ATPG based Preimage Computation: Efficient Search Space Pruning using ZBDD
K Chandrasekar - 2003 - vtechworks.lib.vt.edu
Preimage Computation is a fundamental step in Formal Verification of VLSI designs.
Conventional OBDD-based methods for Formal Verification suffer from spatial explosion …
Conventional OBDD-based methods for Formal Verification suffer from spatial explosion …