Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
Binary decision diagrams and beyond: enabling technologies for formal verification
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Testing for Path Delay Faults Using Test Points
DFT '99 Proceedings of the 14th International Symposium on Defect and Fault-Tolerance in VLSI Systems
An Exact Non-Enumerative Fault Simulator for Path-Delay Faults
Proceedings of the IEEE International Test Conference on Test and Design Validity
Delay Testing for Non-Robust Untestable Circuits
Proceedings of the IEEE International Test Conference on Designing, Testing, and Diagnostics - Join Them
An efficient method for computing exact path delay fault coverage
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Color Counting and its Application to Path Delay Fault Coverage
ISQED '01 Proceedings of the 2nd International Symposium on Quality Electronic Design
ATPG for Path Delay Faults without Path Enumeration
ISQED '01 Proceedings of the 2nd International Symposium on Quality Electronic Design
Accurate Path Delay Fault Coverage is Feasible
ITC '99 Proceedings of the 1999 IEEE International Test Conference
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Improving a nonenumerative method to estimate path delay fault coverage
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
We formulate the fault grading problemas a combinatiorial problem that amounts to storingand manipulating sets on a special type of Binary DecisionDiagrams (BDDs), called zero-suppressed BDDs(ZBDDs), that represent sets in a unique and compactmanner.A simple modification of the basic schemeallows us to overcome memory problems that mayarise by complex set representation.Experimentalresults on the ISCAS'85 benchmarks show considerableimprovement over all existing techniques for exactPDF grading.The main advantages of the proposedmethodology are the simplicity of the approach, interms of it being expressed by a polynomial numberof increasingly efficient BDD-based operations, itsorganization, and its ability to handle very large test sets.