A framework of greedy methods for constructing interaction test suites

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. Gre...

Full description

Saved in:
Bibliographic Details
Main Authors: Bryce, R.C., Colbourn, C.J., Cohen, M.B.
Format: Conference Proceeding
Language:English
Subjects:
Computer science
DSL
Greedy algorithms
Hardware
Linux
Optimization methods
Permission
Portable computers
Software testing
System testing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0270-5257
1558-1225
DOI:10.1109/ICSE.2005.1553557