A new heuristic for test suite reduction

doi:10.1016/S0950-5849(98)00050-0

Information and Software Technology

Volume 40, Issues 5–6, 30 July 1998, Pages 347-354

https://doi.org/10.1016/S0950-5849(98)00050-0 Get rights and content

Abstract

A testing objective has to be defined in testing a program. A test suite is then constructed to satisfy the testing objective. The constructed test suite contains redundancy when some of its proper subsets can still satisfy the same testing objective. Since the costs of executing test cases and maintaining a test suite for regression testing may be expensive, the problem of test suite reduction arises. This paper proposes a heuristic towards the optimization of a test suite.

References (19)

T.Y. Chen et al.
Dividing strategies for the optimization of a test suite
Information Processing Letters
(1996)
D.S. Johnson
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
(1974)
A.V. Aho et al.
Data Structures and Algorithms
(1983)
T.Y. Chen et al.
Heuristics towards the optimization of the size of a test suite
T. Y. Chen, M. F. Lau, On the completeness of 1-to-1 redundancy dividing strategy (submitted for...
T. Y. Chen and M. F. Lau, A simulation study on some heuristics for test suite reduction (submitted for...
T.H. Cormen et al.
Introduction to Algorithms
(1990)
R.A. DeMillo et al.
Constraint-based automatic test data generation
IEEE Transactions on Software Engineering
(1991)
R. Gupta et al.
Employing static information in the generation of test cases, Software Testing
Verification and Reliability
(1993)