Improved nonenumerative path-delay fault-coverage estimation based on optimal polynomial-time algorithms

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

Volumn 16, Issue 3, 1997, Pages 309-315

  Kagaris, Dimitrios ^a   Tragoudas, Spyros ^a   Karayiannis, Dimitrios ^b  

^a Southern Illinois University Carbondale   (United States)

^b Viewlogic Systems Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED NETWORK ANALYSIS; ESTIMATION; FAILURE ANALYSIS; POLYNOMIALS;

NONENUMERATIVE PATH DELAY FAULT COVERAGE ESTIMATION;

COMBINATORIAL CIRCUITS;

EID: 0031095781     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.594836     Document Type: Article

References (17)

1. M. Abramovici, M.A. Breuer, and A. D. Friedman, Digital Systems Testing and Testable Design. New York: Computer Science, 1990.
2. K.-T. Cheng and H.-C. Chen, "Delay testing for nonrobust untestable circuits," in Proc. Int. Test Conf., 1993, pp. 954-961.
3. U. Sparmann, D. Luxemburger, K.-T. Cheng, and S.M. Reddy, "Fast identification of robust dependent path delay faults," in Proc. 32nd Design Automation Conf., 1995, pp. 119-125.
4. W.K. Lam, A. Saldanha, R. K. Brayton, and A. L. Vincentelli, "Delay fault coverage and performance tradeoffs," in Proc. 30th Design Automation Conf., 1993, pp. 445-451.
5. F. Gavril, "Algorithms for maximum k-coloring and minimum k-covering of transitive graphs," Networks, vol. 17, pp. 465-470, 1987.
6. M.R. Garey and D. S. Johnson, Computers and Intractability - A Guide to The Theory of NP-Completeness. New York: Freeman, 1979.
7. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. New York: Academic, 1980.
8. K. Heragu, M.L. Bushnell, and V. D. Agrawal, "An efficient path delay fault coverage estimator," in Proc. 31st Design Automation Conf., 1994, pp. 516-521.
9. K. Heragu, J.H. Patel, and V. D. Agrawal, "Improving accuracy in path delay fault coverage estimation," in Proc. Int. Conf. VLSI Design, 1996, pp. 422-425.
10. E.L. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt Rinehart and Winston, 1976.
11. C.J. Lin and S. M. Reddy, "On delay fault testing in logic circuits," IEEE Trans. Computer-Aided Design, vol. CAD-6, no. 9, pp. 694-703, 1987.
12. J.D. Lesser and J. J. Schedletsky, "An experimental delay test generator for LSI logic," IEEE Trans. Comput., vol C-29, pp. 235-248, 1980.
13. S.M. Reddy, M. K. Reddy, and V. D. Agrawal, "Robust tests for stuck-open faults in CMOS combinational logic circuits," in Proc. Int. Symp. Fault-Tolerant Computing, 1984, pp. 44-49.
14. I. Pomeranz and S.M. Reddy, "An efficient nonenumerative method to estimate the path delay fault coverage in combinational circuits," IEEE Trans. Computer-Aided Design , vol. 13, no. 2, pp. 240-250, 1994.
15. J. Savir and W.H. McAnney, "Random pattern testability of delay faults," in Proc. Int. Test Conf., 1986, pp. 263-273.
16. M.H. Schultz, K. Fuchs, and F. Fink, "Advanced automatic test pattern generation techniques for path delay faults," in Proc. Int. Symposium Fault-Tolerant Computing, 1989, pp. 44-51.
17. K.D. Wagner, "The error latency of delay faults in combinational and sequential circuits," in Proc. Int. Test Conf., 1985, pp. 334-341.