Optimality and Constructions of Locating Arrays

  • Yu Tang
  • Charles J. ColbournEmail author
  • Jianxing Yin


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 Classification



Covering array Interaction faults Locating array 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Beth, T., D. Jungnickel, and H. Lenz. 1999. Design theory. Cambridge, Cambridge University Press.zbMATHGoogle Scholar
  2. Bush, K. A. 1952a. A generalization of the theorem due to MacNeish. Ann. Math. Stat., 23, 293–295.MathSciNetCrossRefGoogle Scholar
  3. Bush, K. A. 1952b. Orthogonal arrays of index unity. Ann. Math. Stat., 23, 426–434.MathSciNetCrossRefGoogle Scholar
  4. Cohen, M. B. 2004. Designing test suites for software interaction testing. Ph.D. thesis. University of Auckland, Auckland, New Zealand.Google Scholar
  5. Colbourn, C. J., and J. H. Dinitz. 2007. Handbook of combinatorial designs. 2nd ed. Boca Raton, FL, Chapman and Hall/CRC Press.zbMATHGoogle Scholar
  6. 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
  7. Colbourn, C. J., S. S. Martirosyan, G. L. Mullen, D. E. Shasha, G. B. Sherwood, and J. L. Yucas. 2006. Products of mixed covering arrays of strength two. J. Combin. Des., 14, 124–138.MathSciNetCrossRefGoogle Scholar
  8. Colbourn, C. J., and D. W. McClary. 2008. Locating and detecting arrays for interaction faults. J. Combin. Optimiz. 15, 17–48.MathSciNetCrossRefGoogle Scholar
  9. Hartman, A. 2005. Software and hardware testing using combinatorial covering suites. In Graph theory, combinatorics and algorithms: Interdisciplinary applications, 237–266. Boston, Springer.CrossRefGoogle Scholar
  10. Hnich, B., S. Prestwich, and E. Selensky. 2005. Constraint-based approaches to the covering test problem. Lecture Notes Comput Sci., 3419, 172–186.CrossRefGoogle Scholar
  11. Ji, L., and J. Yin. 2010. Constructions of new orthogonal arrays and covering arrays of strength three. J. Combin. Theory A, 117, 236–247.MathSciNetCrossRefGoogle Scholar

Copyright information

© Grace Scientific Publishing 2012

Authors and Affiliations

  1. 1.Department of MathematicsSuzhou UniversitySuzhouChina
  2. 2.School of Computing, Informatics, and Decision Systems EngineeringArizona State UniversityTempeUSA

Personalised recommendations