Uma infraestrutura baseada em serviço para evolução do teste de mutação utilizando o tamanho semântico do mutante

• Ano de defesa: 2014
• Autor(a) principal: Sousa, Leonardo da Silva
• Orientador(a): Rodrigues, Cássio Leonardo
• Banca de defesa: Rodrigues, Cássio Leonardo , Vincenzi, Auri Marcelo Rizzo , Alves, Vander Ramos
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal de Goiás
• Programa de Pós-Graduação: Programa de Pós-graduação em Ciência da Computação (INF)
• Departamento: Instituto de Informática - INF (RG)
• País: Brasil
• Palavras-chave em Português: Essencial; Mutantes; Operador; Serviço; Tamanho; Teste
• Palavras-chave em Inglês: Essential; Mutants; Operator; Size; Test; Web-service
• Área do conhecimento CNPq: CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO
• Link de acesso: http://repositorio.bc.ufg.br/tede/handle/tede/4647

Software Testing is indispensable if you want to achieve and guarantee the quality of developed software. There are some techniques to test software, among them Fault-based Testing Technique which includes the Mutation Testing criteria. Mutation Testing uses mutation operators to generate a set of alternative programs, called mutants, which differ from the original program at a particular point in the code. The test cases are applied in the original program and in the mutants in order to verify that the test cases are able to show the difference in behavior between the original program and each mutant. This test criterion stands out because of its effectiveness in measuring the quality of the test while finding defects in the program, however it suffers from the high computational cost required for its execution. There are some approaches that aim to reduce the cost of Mutation Testing, for example, Selective Mutation. Selective Mutation reduces the mutation cost applying a subset of mutation operators that it is capable of generating fewer mutants and still achieving high testing effectiveness. The aim of this paper is find a subset of mutation operators and show such subset is almost as good as the whole set. Thereby, such subset can be used in Selective Mutation.Here, fault is used to select a subset of mutation operators, this is main difference between this work and others works in Mutation Selective. Since Mutation Testing use fault that program could have, there is nothing more logical than using such fault to select operators.