Title :
A graph-theoretic approach to testing iterative arrays
Author_Institution :
Brunel Univ., Uxbridge, UK
Abstract :
A novel graph-theoretic test pattern generation technique for one and two-dimensional iterative arrays is presented. The method is equally applicable to one-dimensional and two-dimensional regular arrays, shows whether or not a given array is C-testable, and readily accommodates array boundary conditions. The graph-search activity is performed using Prolog, which considerably reduces the effort required to implement the software
Keywords :
graph theory; logic arrays; logic testing; C-testable; Prolog; array boundary conditions; graph theory; graph-search activity; graph-theoretic test pattern generation; iterative arrays; one dimensional array; regular arrays; two dimensional array; Arithmetic; Boolean functions; Boundary conditions; Circuit synthesis; Iterative methods; Sorting; Systolic arrays; Test pattern generators; Testing; Very large scale integration;
Conference_Titel :
European Test Conference, 1989., Proceedings of the 1st
Conference_Location :
Paris
Print_ISBN :
0-8186-1937-6
DOI :
10.1109/ETC.1989.36259
