Resultados de búsqueda para Evolutionary computation

Las pruebas de mutación permiten evaluar y mejorar la calidad de los conjuntos de casos de prueba, pero resultan costosas debido a la existencia de muchos mutantes semánticamente equivalentes al código original, lo que requiere la revisión manual de los mutantes. Este trabajo estudia la posibilidad de que estos mutantes equivalentes estén relacionados tomando como base ciertas características comunes, como son los operadores de mutación que los generan o los fragmentos de códigos en los que estos mutantes aparecen. El experimento que se muestra en este artículo ofrece evidencias de la existencia de tales conexiones, lo cual permite abordar el problema de la detección de mutantes equivalentes desde una perspectiva global en lugar de una puramente individual como hasta el momento. En base a ello, se propone un algoritmo evolutivo que utiliza esta relación entre mutantes equivalentes para resolver de forma más eficiente el problema de selección de mutantes. El trabajo fue publicado en Information and Software Technology, revista indexada en Clarivate Journal of Citation Reports con un índice de impacto de 2,726, y que se encuentra en el cuartil Q2 en la categoría Computer Science, Software Engineering (edición del índice: 2019).

Context: Commercial video games usually feature an extensive source code and requirements that are related to code lines from multiple methods. Traceability is vital in terms of maintenance and content update, so it is necessary to explore such search spaces properly.Objective: This work presents and evaluates CODFREL (Code Fragmentbased Requirement Location), our approach to fine-grained requirement traceability, which lies in an evolutionary algorithm and includes encoding and genetic operators to manipulate code fragments that are built from source code lines. We compare it with a baseline approach (Regular-LSI) by configuring both approaches with different granularities (code lines / complete methods).Method: We evaluated our approach and Regular-LSI in the Kromaia video game case study, which is a commercial video game released on PC and PlayStation 4. The approaches are configured with method and code line granularity and work on 20 requirements that are provided by the development company. Our approach and Regular-LSI calculate similarities between requirements and code fragments or methods to propose possible solutions and, in the case of CODFREL, to guide the evolutionary algorithm.Results: The results, which compare code line and method granularity configurations of CODFREL with different granularity configurations of RegularLSI, show that our approach outperforms Regular-LSI in precision and recall, with values that are 26 and 8 times better, respectively, even though it does not achieve the optimal solutions. We make an open-source implementation of CODFREL available.Conclusions: Since our approach takes into consideration key issues like the source code size in commercial video games and the requirement dispersion, it provides better starting points than Regular-LSI in the search for solution candidates for the requirements. However, the results and the influence of domain-specific language on them show that more explicit knowledge is required to improve such results.