OneTestataTime Heuristic Search for Interaction Test Suites ABSTRACT.pdf

One-Test-at-a-Time Heuristic Search for Interaction Test Suites Renée C. Bryce Charles J. Colbourn Computer Science Computer Science University of Nevada at Las Vegas Arizona State University Las Vegas, Nevada Tempe, Arizona reneebryce@cs.unlv.edu colbourn@asu.edu ABSTRACT A software interaction test suite of strength t is an N × k Algorithms for the construction of software interaction test array with N rows each representing a test, k columns each suites have focussed on the special case of pairwise cover- representing a factor , and v number of symbols permitted in age; less is known about efficiently constructing test suites each column representing allowed levels of the factor. Each for higher strength coverage. The combinatorial growth of t-tuple (i.e. selection of t columns, and one of the v levels t-tuples associated with higher strength hinders the efficacy for each of the t corresponding factors) occurs at least once. of interaction testing. Test suites are inherently large, so The size, t, of a tuple is referred to as the strength. Higher testers may not run entire test suites. To address these prob- strength is the term when t 2. Table 1(a) shows four factors that each have three levels. The factors (f ,f ,f , lems