Optimality and Constructions of Locating Arrays
Locating arrays are of interest in generating software test suites to cover all t-way component interactions and locate interaction faults in component-based systems. However, constructions of optimal locating arrays have not been studied systematically. Indeed, no useful lower bound has previously been determined, and only some sporadic examples of optimal locating arrays have been found. When a single fault is to be located, this article develops both a lower bound on the size of locating arrays and some methods of constructing optimal locating arrays. Some infinite series of optimal locating arrays are then obtained.
AMS Subject Classification05B15
Key-wordsCovering array Interaction faults Locating array
Unable to display preview. Download preview PDF.
- Cohen, M. B. 2004. Designing test suites for software interaction testing. Ph.D. thesis. University of Auckland, Auckland, New Zealand.Google Scholar
- Colbourn, C. J., and F. K. Hwang. 2007. Superimposed codes and combinatorial group testing. In Handbook of combinatorial designs. 2nd ed., ed. C. J. Colbourn and J. H. Dinitz, 629–633. Boca Raton, FL, Chapman and Hall/CRC Press.Google Scholar