Detalhes do Documento

Strongly-typed genetic programming and purity analysis: input domain reduction for evolutionary testing problems

Autor(es): Ribeiro, José Carlos Bregieiro ; Zenha-Rela, Mário Alberto ; Fernandéz de Vega, Francisco

Data: 2008

Identificador Persistente: http://hdl.handle.net/10400.8/129

Origem: IC-online

Assunto(s): Input domain reduction; Search-based test case generation; Strongly-typed genetic programming


Descrição

Search-based test case generation for object-oriented software is hindered by the size of the search space, which encompasses the arguments to the implicit and explicit parameters of the test object's public methods. The performance of this type of search problems can be enhanced by the definition of adequate Input Domain Reduction strategies. The focus of our on-going work is on employing evolutionary algorithms for generating test data for the structural unit-testing of Java programs. Test cases are represented and evolved using the Strongly-Typed Genetic Programming paradigm; Purity Analysis is particularly useful in this situation because it provides a means to automatically identify and remove Function Set entries that do not contribute to the definition of interesting test scenarios.

Tipo de Documento Objeto de conferência
Idioma Inglês
Contribuidor(es) Repositório IC-Online
facebook logo  linkedin logo  twitter logo 
mendeley logo

Documentos Relacionados