A scheduling problem in test generation

The order of faults which are targeted for test-pattern generation affects both the processing time for test generation and the number of test-patterns. This order is referred to as a test generation schedule. In this paper, we consider the test generation scheduling problem which minimizes the cost of testing. We analyze the effect of scheduling based on test-pattern generation time and dominating probability. Then, we present experimental results on the ISCAS'85 benchmark circuits.

[1]  Hideo Fujiwara,et al.  On the Acceleration of Test Generation Algorithms , 1983, IEEE Transactions on Computers.

[2]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[3]  Prathima Agrawal,et al.  Test pattern generation for sequential circuits on a network of workstations , 1993, [1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing.

[4]  S. B. Akers,et al.  On the Role of Independent Fault Sets in the Generation of Minimal Test Sets , 1987 .

[5]  Michael H. Schulz,et al.  Improved deterministic test pattern generation with applications to redundancy identification , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Gert-Jan Tromp,et al.  Minimal Test Sets for Combinational Circuits , 1991, 1991, Proceedings. International Test Conference.

[7]  Irith Pomeranz,et al.  COMPACTEST: a method to generate compact test sets for combinational circuits , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Irith Pomeranz,et al.  Cost-effective generation of minimal test sets for stuck-at faults in combinational logic circuits , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Prabhakar Goel,et al.  An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits , 1981, IEEE Transactions on Computers.