A cone-based genetic optimization procedure for test generation and its application to n-detections in combinational circuits

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Test generation procedures based on genetic optimization were shown to be effective in achieving high fault coverage for benchmark circuits. In this work, we propose a representation of test patterns for genetic optimization based test generation, where subsets of inputs are considered as indivisible entities. Using this representation, crossover between two test patterns t 1 and t 2 copies all the values of each subset either from t 1 or from t 2. By keeping input subsets undivided, activation and propagation capabilities of t 1 and t 2 are expected to be captured and carried over to the new test patterns. Experimental results presented show that the proposed scheme results in complete stuck-at test sets and redetection test sets for combinational circuits, even in cases where other procedures report incomplete fault coverages. © 1999 IEEE.

Cite

CITATION STYLE

APA

Pomeranz, I., & Reddy, S. M. (1999). A cone-based genetic optimization procedure for test generation and its application to n-detections in combinational circuits. IEEE Transactions on Computers, 48(10), 1145–1152. https://doi.org/10.1109/12.805164

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free