DMCA
Combination testing strategies: A survey (2005)
Cached
Download Links
- [www.ise.gmu.edu]
- [www.ise.gmu.edu]
- [www.cs.gmu.edu]
- [csrc.nist.gov]
- DBLP
Other Repositories/Bibliography
| Venue: | Software Testing, Verification, and Reliability |
| Citations: | 99 - 6 self |
BibTeX
@ARTICLE{Grindal05combinationtesting,
author = {Mats Grindal and Jeff Offutt and Sten F. Andler},
title = {Combination testing strategies: A survey},
journal = {Software Testing, Verification, and Reliability},
year = {2005},
volume = {15},
pages = {167--199}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
Keyphrases
combination strategy different combination strategy identified combination strategy basic algorithm several combination strategy combinatorial strategy coverage criterion survey paper various coverage criterion test case selection method test case theoretical bound test suite different test object input parameter subsumption hierarchy
