Premium
Combination testing strategies: a survey
Author(s) -
Grindal Mats,
Offutt Jeff,
Andler Sten F.
Publication year - 2005
Publication title -
software testing, verification and reliability
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.216
H-Index - 49
eISSN - 1099-1689
pISSN - 0960-0833
DOI - 10.1002/stvr.319
Subject(s) - computer science , selection (genetic algorithm) , test (biology) , focus (optics) , hierarchy , machine learning , data mining , operations research , mathematics , paleontology , physics , economics , optics , market economy , biology
Combination strategies are test case selection methods that identify test cases by combining values of the different test object input parameters based on some combinatorial strategy. This survey presents 16 different combination strategies, covering more than 40 papers that focus on one or several combination strategies. This collection represents most of the existing work performed on combination strategies. This survey describes the basic algorithms used by the combination strategies. Some properties of combination strategies, including coverage criteria and theoretical bounds on the size of test suites, are also included in this description. This survey paper also includes a subsumption hierarchy that attempts to relate the various coverage criteria associated with the identified combination strategies. Copyright © 2005 John Wiley & Sons, Ltd.