Prioritized interaction testing for pair-wise coverage with seeding and constraints

Renée C. Bryce, Charles Colbourn

Research output: Contribution to journalArticlepeer-review

156 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. In many applications where interaction testing is needed, the entire test suite is not run as a result of time or budget 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 pair-wise interactions are tested, but when terminated after any intermediate number of tests, those deemed most important are tested. In addition, practical concerns of seeding and avoids are addressed. Computational results are reported.

Original languageEnglish (US)
Pages (from-to)960-970
Number of pages11
JournalInformation and Software Technology
Volume48
Issue number10
DOIs
StatePublished - Oct 1 2006

Keywords

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

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Prioritized interaction testing for pair-wise coverage with seeding and constraints'. Together they form a unique fingerprint.

Cite this