@inproceedings{cf53b5acb0244736a167bd2112149f45,
title = "One-test-at-a-time heuristic search for interaction test suites",
abstract = "Algorithms for the construction of software interaction test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing test suites for higher strength coverage. The combinatorial growth of t-tuples associated with higher strength hinders the efficacy of interaction testing. Test suites are inherently large, so testers may not run entire test suites. To address these problems, we combine a simple greedy algorithmallwith heuristic search to construct and dispense one test at a time. Our algorithm attempts to maximize the number of t-tuples covered by the earliest tests so that if a tester only runs a partial test suite, they test as many t-tuples as possible.allHeuristic search is shown to provide effective methods for achieving such coverage.",
keywords = "Covering arrays, Great flood, Heuristic search, Hill climbing, Simulated annealing, Software interaction testing, T-way interaction testing, Tabu search, Test suite prioritization",
author = "Bryce, {Ren{\'e}e C.} and Charles Colbourn",
year = "2007",
doi = "10.1145/1276958.1277173",
language = "English (US)",
isbn = "1595936971",
series = "Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference",
pages = "1082--1089",
booktitle = "Proceedings of GECCO 2007",
note = "9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007 ; Conference date: 07-07-2007 Through 11-07-2007",
}