Constructing interaction test suites with greedy algorithms

Renée C. Bryce, Charles Colbourn

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

8 Scopus citations

Abstract

Combinatorial approaches to testing are used in several fields, and have recently gained momentum in the field of software testing through software interaction testing. One-test-at-a-time greedy algorithms are used to automatically construct such test suites. This paper discusses basic criteria of why greedy algorithms have been appropriate for this test generation problem in the past and then expands upon how greedy algorithms can be utilized to address test suite prioritization.

Original languageEnglish (US)
Title of host publication20th IEEE/ACM International Conference on Automated Software Engineering, ASE 2005
Pages440-443
Number of pages4
DOIs
StatePublished - 2005
Event20th IEEE/ACM International Conference on Automated Software Engineering, ASE 2005 - Long Beach, CA, United States
Duration: Nov 7 2005Nov 11 2005

Other

Other20th IEEE/ACM International Conference on Automated Software Engineering, ASE 2005
CountryUnited States
CityLong Beach, CA
Period11/7/0511/11/05

Keywords

  • Biased covering arrays
  • Covering arrays
  • Greedy algorithm
  • Mixed-level covering arrays
  • Software interaction testing
  • T-way interaction coverage

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Human-Computer Interaction
  • Software

Fingerprint Dive into the research topics of 'Constructing interaction test suites with greedy algorithms'. Together they form a unique fingerprint.

Cite this