This paper extends state-of-the-art ATPG systems by including constraints, called restrictors, on the allowable values of the bits of a test vector. Such restrictors often occur in "real-world" circuits where certain bit positions of a test vector have to take on a particular value (e.g. in case of a reset line) or are prohibited from taking on a particular value (e.g. in order to prevent an illegal state to be entered). This paper describes the types of restrictors, as encountered in "real world" circuits; it shows the required modifications to ATPG algorithms for stuck-at faults in combinational circuits, in order to cope with restrictors; and finally, the results of experiments determining the consequences for the ATPG time and fault coverage are given. The overall conclusion is: restrictors can easily be implemented in any ATPG system; the use of restrictors is essential in "real-world" circuits; the influence of restrictors on the ATPG time is small while a new class of "redundant faults" is identified, belonging to that part of the circuit which cannot be tested due to the specified restrictors.<<ETX>>
[1]
David Bryan,et al.
Combinational profiles of sequential benchmark circuits
,
1989,
IEEE International Symposium on Circuits and Systems,.
[2]
Hideo Fujiwara,et al.
On the Acceleration of Test Generation Algorithms
,
1983,
IEEE Transactions on Computers.
[3]
Rochit Rajsuman.
Digital Hardware Testing: Transistor-Level Fault Modeling and Testing
,
1992
.
[4]
H. Fujiwara,et al.
ON THE ACCELERATION OF TEST GENERATION ALGORlTHMS
,
1995,
Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'..
[5]
Prabhakar Goel,et al.
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
,
1981,
IEEE Transactions on Computers.
[6]
John Feo,et al.
SISAL reference manual
,
1990
.