Intelligent Local Search for Test Case Minimization

12Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For performing efficient regression testing, minimization of test suites is one of the primary approaches. Various kinds of test case minimization techniques have been proposed in the past, in order to do this minimization. However, due to the inherent hardness of this problem, the search for an efficient approach is still going on. In this paper, we propose the application of an intelligent local search algorithm (STAGE), for doing this optimization. The proposed approach performs local search with multiple restarts, using Hill Climbing. But the restart points for the local search are not chosen randomly, rather intelligent decisions are taken for choosing the next starting point. We have observed promising results for the selected subject programs, upon the application of this approach.

Cite

CITATION STYLE

APA

Mohapatra, S. K., Mishra, A. K., & Prasad, S. (2020). Intelligent Local Search for Test Case Minimization. Journal of The Institution of Engineers (India): Series B, 101(5), 585–595. https://doi.org/10.1007/s40031-020-00480-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free