Adaptive evolutionary testing: An adaptive approach to search-based test case generation for object-oriented software

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

Abstract

Adaptive Evolutionary Algorithms are distinguished by their dynamic manipulation of selected parameters during the course of evolving a problem solution; they have an advantage over their static counterparts in that they are more reactive to the unanticipated particulars of the problem. This paper proposes an adaptive strategy for enhancing Genetic Programming-based approaches to automatic test case generation. The main contribution of this study is that of proposing an Adaptive Evolutionary Testing methodology for promoting the introduction of relevant instructions into the generated test cases by means of mutation; the instructions from which the algorithm can choose are ranked, with their rankings being updated every generation in accordance to the feedback obtained from the individuals evaluated in the preceding generation. The experimental studies developed show that the adaptive strategy proposed improves the test case generation algorithm's efficiency considerably, while introducing a negligible computational overhead. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ribeiro, J. C. B., Zenha-Rela, M. A., & De Vega, F. F. (2010). Adaptive evolutionary testing: An adaptive approach to search-based test case generation for object-oriented software. In Studies in Computational Intelligence (Vol. 284, pp. 185–197). https://doi.org/10.1007/978-3-642-12538-6_16

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