Abstract
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.
Original language | English (US) |
---|---|
Pages (from-to) | 20-29 |
Number of pages | 10 |
Journal | Journal of Statistical Theory and Practice |
Volume | 6 |
Issue number | 1 |
DOIs | |
State | Published - Mar 1 2012 |
Keywords
- Covering array
- Interaction faults
- Locating array
ASJC Scopus subject areas
- Statistics and Probability