Software Testing Verification and Reliability · 2005 · 426 citations · 44 references
EducationComputer EngineeringComputer ScienceDesign AutomationTest ConstructionTest DevelopmentComputer-based TestingDesign For TestabilitySoftware TestingTest TheoryCombinatorial TestingCoverage CriteriaSubsumption ReasoningTest Case GenerationTest CasesTest Coverage AnalysisTest Generation
Combination strategies are test case selection methods that identify test cases by combining values of different input parameters based on combinatorial strategies, encompassing most of the existing work in the field. This survey presents 16 different combination strategies, reviews more than 40 papers, describes their basic algorithms, and introduces a subsumption hierarchy relating the various coverage criteria. The authors detail the algorithms used by the strategies, discuss properties such as coverage criteria and theoretical bounds on test suite size, and outline the subsumption hierarchy. © 2005 John Wiley & Sons, Ltd.
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.
44