Test prioritization for pairwise interaction coverage

Renée C. Bryce, Charles Colbourn

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

30 Scopus citations

Abstract

Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing systems to be deployed on a variety of hardware and software configurations. Several algorithms published in the literature are used as tools to automatically generate these test suites; AETG is a well known example of a family of greedy algorithms that generate one test at a time. In many applications where interaction testing is needed, the entire test suite is not run as a result of time or cost constraints. In these situations, it is essential to prioritize the tests. Here we adapt a "one-test-at-a-time" greedy method to take importance of pairs into account. The method can be used to generate a set of tests in order, so that when run to completion all pairwise interactions are tested, but when terminated after any intermediate number of tests, those deemed most important are tested. Computational results on the method are reported.

Original languageEnglish (US)
Title of host publicationProceedings of the 1st International Workshop on Advances in Model-Based Testing, A-MOST '05
DOIs
StatePublished - Dec 1 2005
Event1st International Workshop on Advances in Model-Based Testing, A-MOST '05 - St. Louis, MO, United States
Duration: May 15 2005May 21 2005

Publication series

NameProceedings of the 1st International Workshop on Advances in Model-Based Testing, A-MOST '05

Other

Other1st International Workshop on Advances in Model-Based Testing, A-MOST '05
CountryUnited States
CitySt. Louis, MO
Period5/15/055/21/05

Keywords

  • biased covering arrays
  • covering arrays
  • greedy algorithm
  • mixed-level covering arrays
  • pairwise interaction coverage
  • software interaction testing

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Test prioritization for pairwise interaction coverage'. Together they form a unique fingerprint.

  • Cite this

    Bryce, R. C., & Colbourn, C. (2005). Test prioritization for pairwise interaction coverage. In Proceedings of the 1st International Workshop on Advances in Model-Based Testing, A-MOST '05 [1083275] (Proceedings of the 1st International Workshop on Advances in Model-Based Testing, A-MOST '05). https://doi.org/10.1145/1083274.1083275