Conflict driven techniques for improving deterministic test pattern generation

Authors:
Chen Wang;Sudhakar M. Reddy;Irith Pomeranz;Xijiang Lin;Janusz Rajski
Affiliations:
University of Iowa, Iowa City, IA;University of Iowa, Iowa City, IA;Purdue University, West Lafayette, IN;Mentor Graphics Corp., Wilsonville, OR;Mentor Graphics Corp., Wilsonville, OR
Venue:
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Year:
2002

Citing 11
Cited 4

A topological search algorithm for ATPG

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
A single-path-oriented fault-effect propagation in digital circuits considering multiple-path sensitization

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
REDI: an efficient fault oriented procedure to identify redundant faults in combinational logic circuits

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Recursive Learning: An Attractive Alternative to the Decision Tree for Test Genration in Digital Circuits

Proceedings of the IEEE International Test Conference on Discover the New World of Test and Design
Robust Search Algorithms for Test Pattern Generation

FTCS '97 Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)
SCOAP: Sandia controllability/observability analysis program

DAC '80 Proceedings of the 17th Design Automation Conference
20.2 New Techniques for Deterministic Test Pattern Generation

VTS '98 Proceedings of the 16th IEEE VLSI Test Symposium
SPIRIT: A Highly Robust Combinational Test Generation Algorithm

VTS '01 Proceedings of the 19th IEEE VLSI Test Symposium
Combinational test generation using satisfiability

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

SAT and ATPG: Boolean engines for formal hardware verification

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
An effective and efficient ATPG-based combinational equivalence checker

GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
ATPG-based preimage computation: efficient search space pruning with ZBDD

HLDVT '03 Proceedings of the Eighth IEEE International Workshop on High-Level Design Validation and Test Workshop
EFSM Manipulation to Increase High-Level ATPG Effectiveness

ISQED '06 Proceedings of the 7th International Symposium on Quality Electronic Design

Quantified Score

Hi-index	0.07

Visualization

Abstract

This work presents several new techniques for enhancing the performance of deterministic test pattern generation for VLSI circuits. The techniques introduced are called dynamic decision ordering, conflict driven recursive learning and conflict learning. An important feature shared by all these techniques is that they are triggered by the occurrence of a conflict in the generation of tests. Hence, they are not active all the time nor for all the faults. This feature allows the ATPG system that uses these techniques to resolve hard-to-resolve faults with far fewer backtracks and leaves the system as efficient as before in the absence of conflicts. We have incorporated these techniques into a commercial D-algorithm based ATPG tool. The experimental results on full scan versions of ITC'99 benchmark circuits demonstrate an improvement of the ATPG system both in the number of aborted faults and in test generation time.