An empirical evaluation of evolutionary algorithms for unit test suite generation

Autor(es)

Campos, Jose ^[1] ; Ge, Yan ^[1] ; Albunian, Nasser ^[1] ; Fraser, Gordon ^{[1, 2]} ; Eler, Marcelo ^[3] ; Arcuri, Andrea ^{[4, 5]}

Afiliação do(s) autor(es)

^[1] Univ Sheffield, Dept Comp Sci, Sheffield, S Yorkshire - England

^[2] Univ Passau, Chair Software Engn 2, Passau - Germany

^[3] Univ Sao Paulo, Sao Paulo, SP - Brazil

^[4] Univ Luxembourg, Luxembourg - Luxembourg

^[5] Kristiania Univ Coll, Oslo - Norway

• Tipo de documento: Artigo Científico
• Fonte: INFORMATION AND SOFTWARE TECHNOLOGY; v. 104, p. 207-235, DEC 2018.
• Citações Web of Science: 4

Resumo

Context Evolutionary algorithms have been shown to be effective at generating unit test suites optimised for code coverage. While many specific aspects of these algorithms have been evaluated in detail (e.g., test length and different kinds of techniques aimed at improving performance, like seeding), the influence of the choice of evolutionary algorithm has to date seen less attention in the literature. Objective: Since it is theoretically impossible to design an algorithm that is the best on all possible problems, a common approach in software engineering problems is to first try the most common algorithm, a genetic algorithm, and only afterwards try to refine it or compare it with other algorithms to see if any of them is more suited for the addressed problem. The objective of this paper is to perform this analysis, in order to shed light on the influence of the search algorithm applied for unit test generation. Method: We empirically evaluate thirteen different evolutionary algorithms and two random approaches on a selection of non-trivial open source classes. All algorithms are implemented in the Evosuite test generation tool, which includes recent optimisations such as the use of an archive during the search and optimisation for multiple coverage criteria. Results: Our study shows that the use of a test archive makes evolutionary algorithms clearly better than random testing, and it confirms that the DynaMOSA many-objective search algorithm is the most effective algorithm for unit test generation. Conclusion: Our results show that the choice of algorithm can have a substantial influence on the performance of whole test suite optimisation. Although we can make a recommendation on which algorithm to use in practice, no algorithm is clearly superior in all cases, suggesting future work on improved search algorithms for unit test generation. (AU)

• Processo FAPESP: 15/26044-0 - Geração Automática de Suites de Teste para Aplicativos Móveis usando Teste Baseado em Buscas
• Beneficiário: Marcelo Medeiros Eler
• Modalidade de apoio: Bolsas no Exterior - Pesquisa