Analysis and Evaluation of Heuristic Algorithms for Test Suite Reduction
Yansheng Lu
Abstract
Yansheng Lu
Abstract
During the development and maintenance of software,regression testing is used to enhance confidence to the modified parts of software and guarantee no side effect to the existing parts of software.Regression testing is an expensive process.Test suite reduction algorithm removes all redundant test cases among the test suite to get a minimal subset of test suite that still satisfy test criterion.This paper surveyed the most important heuristic algorithms for test suite reduction in the literature and used a unify framework and terminologies to define and analyze different algorithms.Typi-cal heuristic algorithms for test suite reduction were analyzed and compared.The future work was presented.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
During the development and maintenance of software,regression testing is used to enhance confidence to the modified parts of software and guarantee no side effect to the existing parts of software.Regression testing is an expensive process.Test suite reduction algorithm removes all redundant test cases among the test suite to get a minimal subset of test suite that still satisfy test criterion.This paper surveyed the most important heuristic algorithms for test suite reduction in the literature and used a unify framework and terminologies to define and analyze different algorithms.Typi-cal heuristic algorithms for test suite reduction were analyzed and compared.The future work was presented.
Key concepts: Test suite, Computer science, Regression testing, Algorithm, Reduction (mathematics), Suite, Heuristic, Test case