Abstract
We show that the testing of some binary ILAs is equivalent to a tile problem, which in turn can be formulated as a graph coloring problem. With the aid of the graph model, many M-testable hetero geneous arrays can easily be identified. A good existing graph coloring algorithm, therefore, can be adopted for ILA test generation