## Abstract

A covering arrayCA (N ; t, k, v) is an N × k array such that every N × t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. One application of these objects is to generate software test suites to cover all t-sets of component interactions. Methods for construction of covering arrays for software testing have focused on two main areas. The first is finding new algebraic and combinatorial constructions that produce smaller covering arrays. The second is refining computational search algorithms to find smaller covering arrays more quickly. In this paper, we examine some new cut-and-paste techniques for strength three covering arrays that combine recursive combinatorial constructions with computational search; when simulated annealing is the base method, this is augmented annealing. This method leverages the computational efficiency and optimality of size obtained through combinatorial constructions while benefiting from the generality of a heuristic search. We present a few examples of specific constructions and provide new bounds for some strength three covering arrays.

Original language | English (US) |
---|---|

Pages (from-to) | 2709-2722 |

Number of pages | 14 |

Journal | Discrete Mathematics |

Volume | 308 |

Issue number | 13 |

DOIs | |

State | Published - Jul 6 2008 |

## Keywords

- Combinatorial design
- Covering array
- Generalized Hadamard matrix
- Heuristic search
- Orthogonal array
- Simulated annealing
- Software testing

## ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics