Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Checkpoint Faults are not Sufficient Target Faults for Test Generation
IEEE Transactions on Computers
A topological search algorithm for ATPG
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Logical Design of Digital Systems
Logical Design of Digital Systems
A logic design structure for LSI testability
DAC '77 Proceedings of the 14th Design Automation Conference
EST: The new frontier in automatic test-pattern generation
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
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
BiTeS: a BDD based test pattern generator for strong robust path delay faults
EURO-DAC '94 Proceedings of the conference on European design automation
A Functional Decomposition Method for Redundancy Identification and Test Generation
Journal of Electronic Testing: Theory and Applications
On More Efficient Combinational ATPG Using Functional Learning
VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
Hi-index | 0.00 |
This paper deals with an improved algorithm for identifying redundant faults and finding tests for “hard faults” in combinational circuits. A new, concurrent approach is proposed which is based upon the concepts of functional decomposition, explicit representation of fanout stems and the Boolean difference. The data structure to be used is the Binary Decision Diagram as developed by Lee, Akers and Bryant. This algorithm operates as a backend to test generators which use random patterns or heuristics or a combination of the two.