Constructing interaction test suites with greedy algorithms

PDF DOI 10.1145/1101908.1101994 dblp

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 gen-eration problem in the past and then expands upon how greedy algorithms can be utilized to address test suite pri-oritization.

BibTeX

@inproceedings{Bryce-Colbourn:ASE05,
  author    = {Ren{\'{e}}e C. Bryce and
               Charles J. Colbourn},
  title     = {Constructing interaction test suites with greedy algorithms},
  booktitle = {ASE},
  pages     = {440--443},
  publisher = {{ACM}},
  year      = {2005},
}

Constructing interaction test suites with greedy algorithms

Abstract

Related papers