By Topic

A graph-theoretic approach to testing iterative arrays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
N. Burgess ; Brunel Univ., Uxbridge, UK

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

Published in:

European Test Conference, 1989., Proceedings of the 1st

Date of Conference:

12-14 Apr 1989