ABSTRACT
This chapter addresses a number of issues encountered in combinatorial testing, namely, what should be included as a test parameter, the selection of parameter values, missing combinations, infeasible combinations, and ineectual combinations. Dierent tools address these problems to various degrees using a variety of approaches. All of them however require the identication of the test parameters and the test values involved, so this, and not the tools, will be our focus. e answers given to these problems have arisen from the experience of the author in teaching the method to graduate students in soware engineering, from observing its application in the same context, and from a review of the literature. ey are not intended to be denitive and they continue to evolve with more extensive use of combinatorial testing. is chapter builds on the concepts introduced in Chapter 3 and those of the classication tree method (CTM) [79] to identify and document the SUT test parameters and their values.
