|
ABSTRACT
This article addresses the problem of test pattern generation for single stuck-at faults in combinational circuits, under the additional constraint that the number of specified primary input assignments is minimized. This problem has different applications in testing, including the identification of "don't care" conditions to be used in the synthesis of Built-In Self-Test (BIST) logic. The proposed solution is based on an integer linear programming (ILP) formulation which builds on an existing Propositional Satisfiability (SAT) model for test pattern generation. The resulting ILP formulation is linear on the size of the original SAT model for test generation, which is linear on the size of the circuit. Nevertheless, the resulting ILP instances represent complex optimization problems, that require dedicated ILP algorithms. Preliminary results on benchmark circuits validate the practical applicability of the test pattern minimization model and associated ILP algorithm.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
ABRAMOVICI, M., BREUER, M. A., AND FRIEDMAN, A. D. 1990. Digital Systems Testing and Testable Design. IEEE Press, New York.
|
| |
2
|
BRGLEZ,F.,AND FUJIWARA, H. 1985. A neutral list of 10 combinational benchmark circuits and a target translator in FORTRAN. In Proceedings of the IEEE International Symposium on Circuits and Systems.
|
| |
3
|
|
| |
4
|
CHAKRADHAR,S.T.,AGRAWAL,V.D.,AND ROTHWEILER, S. G. 1993. A transitive closure algorithm for test generation. IEEE Trans. Comput.-Aided Des. 12, 7 (July), 1015-1028.
|
| |
5
|
COX, H., AND RAJSKI, J. 1994. On necessary and nonconflicting assignments in algorithmic test patterns generation. IEEE Trans. Comput.-Aided Des. 13, 4 (Apr.), 515-530.
|
| |
6
|
FLORES, P., NETO, H., AND MARQUES-SILVA, J. 2000. On computing minimum size test patterns. Tech. Rep. RT/008/2000 (Sept.). INESC, Lisbon, Portugal.
|
| |
7
|
FUJIWARA, H., AND SHIMONO, T. 1983. On the acceleration of test generation algorithms. IEEE Trans. Comput. 32, 12 (Dec.), 1137-1144.
|
| |
8
|
|
| |
9
|
GOEL, P. 1981. An implicit enumeration algorithm to generate tests for combinational logic circuits. IEEE Trans. Comput. 30, 3 (Mar.), 215-222.
|
| |
10
|
Sybille Hellebrand , Birgit Reeb , Steffen Tarnick , Hans-Joachim Wunderlich, Pattern generation for a deterministic BIST scheme, Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, p.88-94, November 05-09, 1995, San Jose, California, United States
|
| |
11
|
IWLS. 1989. Test benchmark suite. International Workshop on Logic Synthesis 1989. Available from http://www.cbl.ncsu.edu/pub/Benchmark dirs/LGSynth89/.
|
 |
12
|
|
| |
13
|
|
| |
14
|
LARRABEE, T. 1992. Test pattern generation using Boolean satisfiability. IEEE Trans. Comput.-Aided Des. 11, 1 (Jan.), 4-15.
|
| |
15
|
LEE,H.K.,AND HA, D. S. 1993. On the generation of test patterns for combinational circuits. Tech. Rep. 12 93, Department of Electrical Engineering, Virginia Polytechnic Institute and State University.
|
| |
16
|
|
| |
17
|
|
| |
18
|
|
| |
19
|
POMERANZ, I., REDDY,L.N.,AND REDDY, S. M. 1993. COMPACTEST: A method to generate compact test sets for combinational circuits. IEEE Trans. Comput.-Aided Des. Integ. Circ. Syst. 12, 7 (July), 1040-1049.
|
| |
20
|
SCHULZ,M.H.,AND AUTH, E. 1989. An improved deterministic test pattern generation with applications to redundancy identification. IEEE Trans. Comput.-Aided Des. 8, 7 (July), 811-816.
|
 |
21
|
|
| |
22
|
|
| |
23
|
STEPHAN, P. R., BRAYTON,R.K.,AND SANGIOVANNI-VINCENTELLI, A. L. 1996. Combinational test generation using satisfiability. IEEE Trans. Comput.-Aided Des. 15, 9 (Sept.), 1167-1176.
|
| |
24
|
|
|