A framework of greedy methods for constructing interaction test suites

Renée C. Bryce, Charles Colbourn, Myra B. Cohen

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

101 Scopus citations

Abstract

Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one test at a time. Within this framework are many instantiations of greedy methods generalizing those in the literature. Greedy algorithms are popular when the time for test suite construction is of paramount concern. We focus on the size of the test suite produced by each instantiation. Experiments are analyzed using statistical techniques to determine the importance of the implementation decisions within the framework. This framework provides a platform for optimizing the accuracy and speed of "one-test-at-a-time" greedy methods.

Original languageEnglish (US)
Title of host publicationProceedings - 27th International Conference on Software Engineering, ICSE05
Pages146-155
Number of pages10
StatePublished - 2005
Event27th International Conference on Software Engineering, ICSE05 - St. Louis, MO, United States
Duration: May 15 2005May 21 2005

Other

Other27th International Conference on Software Engineering, ICSE05
CountryUnited States
CitySt. Louis, MO
Period5/15/055/21/05

Keywords

  • Covering arrays
  • Greedy algorithm
  • Mixed-level covering arrays
  • Pair-wise interaction coverage
  • Software interaction testing

ASJC Scopus subject areas

  • Engineering(all)
  • Software

Fingerprint Dive into the research topics of 'A framework of greedy methods for constructing interaction test suites'. Together they form a unique fingerprint.

  • Cite this

    Bryce, R. C., Colbourn, C., & Cohen, M. B. (2005). A framework of greedy methods for constructing interaction test suites. In Proceedings - 27th International Conference on Software Engineering, ICSE05 (pp. 146-155)