Empirically identifying the best greedy algorithm for covering array generation

Changhai Nie, Jing Jiang, Huayao Wu, Hareton Leung, Charles Colbourn

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

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 languageEnglish (US)
Title of host publicationProceedings - IEEE 6th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2013
Pages239-248
Number of pages10
DOIs
StatePublished - 2013
EventIEEE 6th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2013 - Luxembourg, Luxembourg
Duration: Mar 18 2013Mar 20 2013

Other

OtherIEEE 6th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2013
CountryLuxembourg
CityLuxembourg
Period3/18/133/20/13

Keywords

  • combinatorial testing
  • covering array
  • greedy methods

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Empirically identifying the best greedy algorithm for covering array generation'. Together they form a unique fingerprint.

  • Cite this

    Nie, C., Jiang, J., Wu, H., Leung, H., & Colbourn, C. (2013). Empirically identifying the best greedy algorithm for covering array generation. In Proceedings - IEEE 6th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2013 (pp. 239-248). [6571639] https://doi.org/10.1109/ICSTW.2013.36