Efficiently Finding Useless Mutants
Autor(a) principal: | |
---|---|
Data de Publicação: | 2021 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Revista Eletrônica de Iniciação Científica |
Texto Completo: | https://journals-sol.sbc.org.br/index.php/reic/article/view/2079 |
Resumo: | Mutation analysis is a popular but costly approach to assess the quality of test suites. Equivalent and redundant mutants contribute to increase costs and are harmful to the design of test suites. We propose a lightweight technique to identify equivalent and redundant mutants based on theorem proving with Z3 in the context of weak mutation testing. The experiments reveal that our technique detects all equivalent mutants detected by TCE and we have an average reduction of 72.52% of mutants, when considering entire programs. We also apply our technique on HOMs. When considering both FOMs and HOMs, 91% of the mutations could be discarded on average. The results found by our approach may help to make mutation testing less expensive and more accurate. |
id |
SBC-7_8a50204d5ee4e9b0f56f1d0aa6750246 |
---|---|
oai_identifier_str |
oai:journals-sol.sbc.org.br:article/2079 |
network_acronym_str |
SBC-7 |
network_name_str |
Revista Eletrônica de Iniciação Científica |
repository_id_str |
|
spelling |
Efficiently Finding Useless MutantsEfficiently Finding Useless MutantsMutantsWeak MutationTheorem ProvingMutantsWeak MutationTheorem ProvingMutation analysis is a popular but costly approach to assess the quality of test suites. Equivalent and redundant mutants contribute to increase costs and are harmful to the design of test suites. We propose a lightweight technique to identify equivalent and redundant mutants based on theorem proving with Z3 in the context of weak mutation testing. The experiments reveal that our technique detects all equivalent mutants detected by TCE and we have an average reduction of 72.52% of mutants, when considering entire programs. We also apply our technique on HOMs. When considering both FOMs and HOMs, 91% of the mutations could be discarded on average. The results found by our approach may help to make mutation testing less expensive and more accurate.Mutation analysis is a popular but costly approach to assess the quality of test suites. Equivalent and redundant mutants contribute to increase costs and are harmful to the design of test suites. We propose a lightweight technique to identify equivalent and redundant mutants based on theorem proving with Z3 in the context of weak mutation testing. The experiments reveal that our technique detects all equivalent mutants detected by TCE and we have an average reduction of 72.52% of mutants, when considering entire programs. We also apply our technique on HOMs. When considering both FOMs and HOMs, 91% of the mutations could be discarded on average. The results found by our approach may help to make mutation testing less expensive and more accurate.SBC2021-06-03info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://journals-sol.sbc.org.br/index.php/reic/article/view/2079Revista Eletrônica de Iniciação Científica em Computação; Vol. 19 No. 2 (2021)Electronic Journal of Undergraduate Research on Computing; Vol. 19 No. 2 (2021)1519-821910.5753/reic.2021.19.2reponame:Revista Eletrônica de Iniciação Científicainstname:Sociedade Brasileira de Computação (SBC)instacron:SBCenghttps://journals-sol.sbc.org.br/index.php/reic/article/view/2079/1755Copyright (c) 2021 Revista Eletrônica de Iniciação Científica em Computaçãoinfo:eu-repo/semantics/openAccessSouza, BeatrizGheyi, Rohit2021-09-04T21:47:41Zoai:journals-sol.sbc.org.br:article/2079Revistahttps://journals-sol.sbc.org.br/index.php/reic/ONGhttps://journals-sol.sbc.org.br/index.php/reic/oaipublicacoes@sbc.org.br1519-82191519-8219opendoar:2021-09-04T21:47:41Revista Eletrônica de Iniciação Científica - Sociedade Brasileira de Computação (SBC)false |
dc.title.none.fl_str_mv |
Efficiently Finding Useless Mutants Efficiently Finding Useless Mutants |
title |
Efficiently Finding Useless Mutants |
spellingShingle |
Efficiently Finding Useless Mutants Souza, Beatriz Mutants Weak Mutation Theorem Proving Mutants Weak Mutation Theorem Proving |
title_short |
Efficiently Finding Useless Mutants |
title_full |
Efficiently Finding Useless Mutants |
title_fullStr |
Efficiently Finding Useless Mutants |
title_full_unstemmed |
Efficiently Finding Useless Mutants |
title_sort |
Efficiently Finding Useless Mutants |
author |
Souza, Beatriz |
author_facet |
Souza, Beatriz Gheyi, Rohit |
author_role |
author |
author2 |
Gheyi, Rohit |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Souza, Beatriz Gheyi, Rohit |
dc.subject.por.fl_str_mv |
Mutants Weak Mutation Theorem Proving Mutants Weak Mutation Theorem Proving |
topic |
Mutants Weak Mutation Theorem Proving Mutants Weak Mutation Theorem Proving |
description |
Mutation analysis is a popular but costly approach to assess the quality of test suites. Equivalent and redundant mutants contribute to increase costs and are harmful to the design of test suites. We propose a lightweight technique to identify equivalent and redundant mutants based on theorem proving with Z3 in the context of weak mutation testing. The experiments reveal that our technique detects all equivalent mutants detected by TCE and we have an average reduction of 72.52% of mutants, when considering entire programs. We also apply our technique on HOMs. When considering both FOMs and HOMs, 91% of the mutations could be discarded on average. The results found by our approach may help to make mutation testing less expensive and more accurate. |
publishDate |
2021 |
dc.date.none.fl_str_mv |
2021-06-03 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://journals-sol.sbc.org.br/index.php/reic/article/view/2079 |
url |
https://journals-sol.sbc.org.br/index.php/reic/article/view/2079 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://journals-sol.sbc.org.br/index.php/reic/article/view/2079/1755 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2021 Revista Eletrônica de Iniciação Científica em Computação info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2021 Revista Eletrônica de Iniciação Científica em Computação |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
SBC |
publisher.none.fl_str_mv |
SBC |
dc.source.none.fl_str_mv |
Revista Eletrônica de Iniciação Científica em Computação; Vol. 19 No. 2 (2021) Electronic Journal of Undergraduate Research on Computing; Vol. 19 No. 2 (2021) 1519-8219 10.5753/reic.2021.19.2 reponame:Revista Eletrônica de Iniciação Científica instname:Sociedade Brasileira de Computação (SBC) instacron:SBC |
instname_str |
Sociedade Brasileira de Computação (SBC) |
instacron_str |
SBC |
institution |
SBC |
reponame_str |
Revista Eletrônica de Iniciação Científica |
collection |
Revista Eletrônica de Iniciação Científica |
repository.name.fl_str_mv |
Revista Eletrônica de Iniciação Científica - Sociedade Brasileira de Computação (SBC) |
repository.mail.fl_str_mv |
publicacoes@sbc.org.br |
_version_ |
1832113225401892864 |