Mexican International Conference on Artificial Intelligence

Advances in Artificial Intelligence and Soft Computing pp 158-177

# A Branch & Bound Algorithm to Derive a Direct Construction for Binary Covering Arrays

• Jose Torres-Jimenez
• Idelfonso Izquierdo-Marquez
• Aldo Gonzalez-Gomez
• Himer Avila-George
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9413)

## Abstract

Covering arrays are used in testing deterministic systems where failures occur as a result of interactions among subsystems. The goal is to reveal if any interaction induces a failure in the system. Application areas include software and hardware testing. A binary covering array CA(N;t,k,2) is an $$N \times k$$ array over the alphabet $$\{0,1\}$$ with the property that each set of t columns contains all the $$2^t$$ possible t-tuples of 0’s and 1’s at least once. In this paper we propose a direct method to construct binary covering arrays using an specific interpretation of binomial coefficients: a binomial coefficient with parameters k and r will be interpreted as the set of all the k-tuples from $$\{0,1\}$$ having r ones and $$k-r$$ zeroes. For given values of k and t, the direct method uses an explicit formula in terms of both k and t to provide a covering array CA(N;t,k,2) expressed as the juxtaposition of a set of binomial coefficients; this covering array will be of the minimum size that can be obtained by any juxtaposition of binomial coefficients. In order to derive the formula, a Branch & Bound (B&B) algorithm was first developed; the B&B algorithm provided solutions for small values of k and t that allowed the identification of the general pattern of the solutions. Like others previously reported methods, our direct method finds optimal covering arrays for $$k = t+1$$ and $$k = t+2$$; however, the major achievement is that nine upper bounds were significantly improved by our direct method, plus the fact that the method is able to set an infinite number of new upper bounds for $$t \ge 7$$ given that little work has been done to compute binary covering arrays for general values of k and t.

### References

1. 1.
Avila-George, H., Torres-Jimenez, J., Gonzalez-Hernandez, L., Hernández, V.: Metaheuristic approach for constructing functional test-suites. IET Softw. 7(2), 104–117 (2013)
2. 2.
Bush, K.A.: Orthogonal arrays of index unity. Ann. Math. Stat. 23(3), 426–434 (1952)
3. 3.
Cawse, J.N.: Experimental Design for Combinatorial and High Throughput Materials Development. John Wiley & Sons, Hoboken (2003)Google Scholar
4. 4.
Chateauneuf, M., Colbourn, C.J., Kreher, D.: Covering arrays of strength three. Des. Codes Crypt. 16(3), 235–242 (1999)
5. 5.
Cohen, M.B., Colbourn, C.J., Ling, A.C.H.: Constructing strength three covering arrays with augmented annealing. Discrete Math. 308(13), 2709–2722 (2008)
6. 6.
Colbourn, C.J.: Covering arrays from cyclotomy. Des. Codes Crypt. 55, 201–219 (2010)
7. 7.
Colbourn, C.J., Cohen, M.B.: A deterministic density algorithm for pairwise interaction coverage. In: Proceedings of the IASTED - International Conference on Software Engineering, pp. 345–352 (2004)Google Scholar
8. 8.
Colbourn, C.J., Kéri, G., Rivas Soriano, P.P., Schlage-Puchta, J.C.: Covering and radius-covering arrays: constructions and classification. Discrete Appl. Math. 158(11), 1158–1180 (2010)
9. 9.
Colbourn, C.J., Martirosyan, S.S., Mullen, G.L., Shasha, D., Sherwood, G.B., Yucas, J.L.: Products of mixed covering arrays of strength two. Comb. Designs 14(2), 124–138 (2006)
10. 10.
Flottes, M.L., Dupuis, S., Ba, P.S., Rouzeyre, B.: On the limitations of logic testing for detecting hardware Trojans horses. In: 2015 10th International Conference on Design Technology of Integrated Systems in Nanoscale Era (DTIS), pp. 1–5, April 2015Google Scholar
11. 11.
Forbes, M., Lawrence, J., Lei, Y., Kacker, R.N., Kuhn, D.R.: Covering arrays generated by IPOG-F (2012). http://math.nist.gov/coveringarrays/ipof/ipof-results.html
12. 12.
Hartman, A.: Software and hardware testing using combinatorial covering suites. Graph Theory. Combinatorics and Algorithms. Operations Research/Computer Science Interfaces Series, pp. 237–266. Springer, US (2005)
13. 13.
Hedayat, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays: Theory and Applications. Springer-Verlag, New York (1999)
14. 14.
Katona, G.O.H.: Two applications (for search theory and truth functions) of sperner type theorems. Periodica Mathematica Hungarica 3(1–2), 19–26 (1973)
15. 15.
Kitsos, P., Dimitris, E.S., Torres-Jimenez, J., Voyiatzis, A.G.: Exciting FPGA cryptographic Trojans using combinatorial testing. In: Proceedings of the 26th IEEE International Symposium on Software Reliability Engineering (accepted 2015)Google Scholar
16. 16.
Kleitman, D.J., Spencer, J.: Families of k-independent sets. Discrete Math. 6(3), 255–262 (1973)
17. 17.
Lawrence, J., Kacker, R.N., Lei, Y., Kuhn, D.R., Forbes, M.: A survey of binary covering arrays. Electron. J. Comb. 18(1), 1–30 (2011)
18. 18.
Lei, Y., Kacker, R.N., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG: a general strategy for T-way software testing. In: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, pp. 549–556 (2007)Google Scholar
19. 19.
Martinez-Pena, J.: Construction of covering arrays of ternary alphabet and variable strength. Master’s thesis, CINVESTAV-Tamaulipas, Information Technology Laboratory, January 2011Google Scholar
20. 20.
Meagher, K., Stevens, B.: Group construction of covering arrays. J. Comb. Designs 13(1), 70–77 (2005)
21. 21.
Mingfu, X., Aiqun, H., Yi, H., Guyue, L.: Monte Carlo based test pattern generation for hardware Trojan detection. In: IEEE 11th International Conference on Dependable, Autonomic and Secure Computing (DASC 2013), pp. 131–136, December 2013Google Scholar
22. 22.
Nurmela, K.J.: Upper bounds for covering arrays by tabu search. Discrete Appl. Math. 138(1–2), 143–152 (2004)
23. 23.
Shasha, D.E., Kouranov, A.Y., Lejay, L.V., Chou, M.F., Coruzzi, G.M.: Using combinatorial design to study regulation by multiple input signals: a tool for parsimony in the post-genomics era. Plant Physiol. 127(4), 1590–1594 (2001)
24. 24.
Shiba, T., Tsuchiya, T., Kikuno, T.: Using artificial life techniques togenerate test cases for combinatorial testing.In: Proceedings of the 28th Annual International Computer Softwareand Applications Conference, vol. 01, pp. 72–77 (2004)Google Scholar
25. 25.
Sloane, N.J.A.: Covering arrays and intersecting codes. J. Comb. Designs 1(1), 51–63 (1993)
26. 26.
Stardom, J.: Metaheuristics and the search for covering and packing arrays. Master’s thesis, Simon Fraser University (2001)Google Scholar
27. 27.
Stevens, B., Mendelsohn, E.: New recursive methods for transversal covers. J. Comb. Designs 7(3), 185–203 (1999)
28. 28.
Tang, D.T., Chen, C.L.: Iterative exhaustive pattern generation for logic testing. IBM J. Res. Dev. 28(2), 212–219 (1984)
29. 29.
Tang, D.T., Woo, L.S.: Exhaustive test pattern generation with constant weight vectors. IEEE Trans. Comput. 32(12), 1145–1150 (1983)
30. 30.
Torres-Jimenez, J., Rodriguez-Tello, E.: New bounds for binary covering arrays using simulated annealing. Inf. Sci. 185(1), 137–152 (2012)
31. 31.
Walker II, R.A., Colbourn, C.J.: Tabu search for covering arrays using permutation vectors. J. Stat. Plann. Infer. 139(1), 69–80 (2009)
32. 32.
Yin, J.: Constructions of difference covering arrays. J. Comb. Theor. Ser. A 104(2), 327–339 (2003)

© Springer International Publishing Switzerland 2015

## Authors and Affiliations

• Jose Torres-Jimenez
• 1
• Idelfonso Izquierdo-Marquez
• 1
• Aldo Gonzalez-Gomez
• 1
• Himer Avila-George
• 2
• 3