Abstract
Covering array generation is a key issue in combinatorial testing. A number of researchers have been applying greedy algorithms for covering array construction. A greedy framework has been built to integrate most greedy algorithms and evaluate new approaches derived from this framework. However, this framework is affected by multiple factors, which makes its deployment and optimization very challenging. In order to identify the best configuration, we propose a search method that combines pair wise coverage with either base choice or hill climbing techniques. We conduct three different groups of experiments based on six decisions of the greedy framework. The influence of these decisions and their interactions are studied systematically, and the selected greedy algorithm for covering array generation is shown to be better than the existing greedy algorithms.
Original language | English (US) |
---|---|
Title of host publication | Proceedings - IEEE 6th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2013 |
Pages | 239-248 |
Number of pages | 10 |
DOIs | |
State | Published - 2013 |
Event | IEEE 6th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2013 - Luxembourg, Luxembourg Duration: Mar 18 2013 → Mar 20 2013 |
Other
Other | IEEE 6th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2013 |
---|---|
Country/Territory | Luxembourg |
City | Luxembourg |
Period | 3/18/13 → 3/20/13 |
Keywords
- combinatorial testing
- covering array
- greedy methods
ASJC Scopus subject areas
- Software