A graph-theoretic approach to testing iterative arrays

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.<
>