Investigação de similaridade entre programas para apoiar o teste de mutação
| Main Author: | |
|---|---|
| Publication Date: | 2019 |
| Format: | Master thesis |
| Language: | por |
| Source: | Repositório Institucional da UFSCAR |
| Download full: | https://repositorio.ufscar.br/handle/20.500.14289/12095 |
Summary: | Context: The Mutation Analysis criterion – or, mutation testing – allows both the evaluation of test sets and the identification of faults present in the software. The criterion is considered effective, however has gaps in relation to its efficiency. Many cost reduction techniques have been presented however, the results yielded by these techniques are little generalizable to different groups of programs. Some studies in this context presented heuristics to calculate similarity between programs as a way to support cost reduction, but the calculation was not the central theme of the studies. Goals: This work investigated the similarity between programs, in the context of mutation testing of object-oriented programs, as primary information source to support the definition of a strategy to reduce the cost of the criterion. Methodology: The work included: (i) A literature research to characterize the similarity calculation in the presented context; (ii) The definition of a conceptual framework to apply similarity as a supportive technique for cost reduction strategies; and (iii) automation of the framework. The similarity is inferred through the clustering of CK metrics information. The tool also handles calculation and results from the employed cost reduction techniques; and (iv) An experiment and results analysis. Java classes were clustered and the values of mutation scores per operator of the classes and clusters were calculated. In the context of the One-Op cost reduction technique, the best candidate operators were compared between the generated groups and the classes individually. Results: As results, we have the description of similarity calculation in the presented context; a conceptual framework and respective support tool; and a experiment in 38 classes organized in 3 databases. Conclusion: The relevance of similarity was observed, thus allowing for further experiments involving operators obtained from similar programs to be applied to untested programs in the context of the criterion and strategy of cost reduction. |
| id |
SCAR_16d9cb09b4879f3ff1ccac2d7f93c213 |
|---|---|
| oai_identifier_str |
oai:repositorio.ufscar.br:20.500.14289/12095 |
| network_acronym_str |
SCAR |
| network_name_str |
Repositório Institucional da UFSCAR |
| repository_id_str |
4322 |
| spelling |
Dallilo, LucasFerrari, Fabianohttp://lattes.cnpq.br/3154345471250570http://lattes.cnpq.br/524060940189509669b6e939-458b-49ff-a50d-aa974ba0d3f02019-12-03T13:39:41Z2019-12-03T13:39:41Z2019-05-20DALLILO, Lucas. Investigação de similaridade entre programas para apoiar o teste de mutação. 2019. Dissertação (Mestrado em Ciência da Computação) – Universidade Federal de São Carlos, São Carlos, 2019. Disponível em: https://repositorio.ufscar.br/handle/20.500.14289/12095.https://repositorio.ufscar.br/handle/20.500.14289/12095Context: The Mutation Analysis criterion – or, mutation testing – allows both the evaluation of test sets and the identification of faults present in the software. The criterion is considered effective, however has gaps in relation to its efficiency. Many cost reduction techniques have been presented however, the results yielded by these techniques are little generalizable to different groups of programs. Some studies in this context presented heuristics to calculate similarity between programs as a way to support cost reduction, but the calculation was not the central theme of the studies. Goals: This work investigated the similarity between programs, in the context of mutation testing of object-oriented programs, as primary information source to support the definition of a strategy to reduce the cost of the criterion. Methodology: The work included: (i) A literature research to characterize the similarity calculation in the presented context; (ii) The definition of a conceptual framework to apply similarity as a supportive technique for cost reduction strategies; and (iii) automation of the framework. The similarity is inferred through the clustering of CK metrics information. The tool also handles calculation and results from the employed cost reduction techniques; and (iv) An experiment and results analysis. Java classes were clustered and the values of mutation scores per operator of the classes and clusters were calculated. In the context of the One-Op cost reduction technique, the best candidate operators were compared between the generated groups and the classes individually. Results: As results, we have the description of similarity calculation in the presented context; a conceptual framework and respective support tool; and a experiment in 38 classes organized in 3 databases. Conclusion: The relevance of similarity was observed, thus allowing for further experiments involving operators obtained from similar programs to be applied to untested programs in the context of the criterion and strategy of cost reduction.Contexto: O critério Análise de Mutação - ou, teste de mutação – possibilita tanto a avaliação de conjuntos de teste quanto a identificação de defeitos presentes no software. O critério é considerado como sendo eficaz, porém apresenta lacunas em relação à sua eficiência. Muitas técnicas de redução de custo foram apresentadas porém os resultados dessas técnicas são pouco generalizáveis para grupos distintos de programas. Alguns estudos nessa linha apresentaram heurísticas para calcular a similaridade entre programas e auxiliar suas propostas, mas o cálculo não era o tema central dos estudos. Objetivos: Este trabalho investigou a similaridade entre programas, no contexto do teste de mutação de programas OO, como subsídio primário para apoiar estratégias de redução de custo no critério. Metodologia: O trabalho incluiu: (i) uma pesquisa bibliográfica para caracterizar o cálculo de similaridade no contexto apresentado; (ii) a definição de um framework conceitual que utiliza a similaridade como suporte a estratégias de redução de custos; (iii) o desenvolvimento de uma ferramenta baseada no framework. A similaridade ´e inferida por meio da clusterização de métricas CK. A ferramenta também manipula os cálculos e resultados provenientes da técnica de redução de custo empregada; e (iv) um experimento e análise de resultados. Classes Java foram clusterizadas e os valores de escores de mutação por operador, das classes e clusters foram calculados. No contexto da técnica de redução de custo One-Op, os melhores operadores foram comparados entre os grupos criados e as classes individualmente. Resultados: Como resultados, têm-se a descrição do cálculo de similaridade no contexto apresentado; um framework conceitual e respectivo ferramental de apoio; e um experimento em 38 classes organizadas em 3 bases de dados. Conclusões: A relevância da similaridade foi constatada, possibilitando futuros testes dos operadores candidatos dos grupos similares sendo aplicados em novos programas no contexto do critério e estratégia de redução de custo.Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)CAPES: 1588700 - 001porUniversidade Federal de São CarlosCâmpus São CarlosPrograma de Pós-Graduação em Ciência da Computação - PPGCCUFSCarTeste de softwareAnálise de mutaçãoTeste de mutaçãoTécnicas de redução de custoSimilaridadeClusterizaçãoOne-OpSoftware testMutation analysisMutation testCost re-duction techniquesSimilarityClusteringCIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::METODOLOGIA E TECNICAS DA COMPUTACAOInvestigação de similaridade entre programas para apoiar o teste de mutaçãoInvestigation of program similarity to support mutation testinginfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisOnline600600c2f54b8f-f3f5-450e-9a5d-b847af844d31info:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFSCARinstname:Universidade Federal de São Carlos (UFSCAR)instacron:UFSCARORIGINALDissertacao_LucasDallilo.pdfDissertacao_LucasDallilo.pdfapplication/pdf1756230https://repositorio.ufscar.br/bitstreams/b0b2b127-ba6e-4724-b3de-93a192813926/download7135d8182ec88374d8d71ff71f6ca58cMD51trueAnonymousREADCarta_Comprovante_PPGCC_dec_BCO.pdfCarta_Comprovante_PPGCC_dec_BCO.pdfapplication/pdf116582https://repositorio.ufscar.br/bitstreams/384eaccd-e402-4603-be99-a16c3a961075/download395078b2bce70ecea75cd80ebfd1fa03MD52falseAnonymousREADLICENSElicense.txtlicense.txttext/plain; charset=utf-81957https://repositorio.ufscar.br/bitstreams/38c88cca-73d3-4aba-9422-ebeb5ba9d635/downloadae0398b6f8b235e40ad82cba6c50031dMD53falseAnonymousREADTEXTDissertacao_LucasDallilo.pdf.txtDissertacao_LucasDallilo.pdf.txtExtracted texttext/plain244950https://repositorio.ufscar.br/bitstreams/ec8be3b4-2e82-4b9e-ba6d-e452f556e1d1/downloadf2a1ef8a5f61930be68755dd79fd46f3MD58falseAnonymousREADCarta_Comprovante_PPGCC_dec_BCO.pdf.txtCarta_Comprovante_PPGCC_dec_BCO.pdf.txtExtracted texttext/plain1220https://repositorio.ufscar.br/bitstreams/aea67767-931f-439d-9f61-58fea0db9590/downloadbc6604f8e6d16095362e9b38d512138bMD510falseAnonymousREADTHUMBNAILDissertacao_LucasDallilo.pdf.jpgDissertacao_LucasDallilo.pdf.jpgIM Thumbnailimage/jpeg3950https://repositorio.ufscar.br/bitstreams/2ab7bad7-f899-4578-9a5f-04d688e5668e/download5c1ecc855e63d4a53e19aea754c4cc97MD59falseAnonymousREADCarta_Comprovante_PPGCC_dec_BCO.pdf.jpgCarta_Comprovante_PPGCC_dec_BCO.pdf.jpgIM Thumbnailimage/jpeg10981https://repositorio.ufscar.br/bitstreams/ccd5ccc4-21d7-4717-88a0-d0b0b4ae9321/downloadce86b81dd824d6106ade7bfb80682085MD511falseAnonymousREAD20.500.14289/120952025-02-05 18:15:10.607Acesso abertoopen.accessoai:repositorio.ufscar.br:20.500.14289/12095https://repositorio.ufscar.brRepositório InstitucionalPUBhttps://repositorio.ufscar.br/oai/requestrepositorio.sibi@ufscar.bropendoar:43222025-02-05T21:15:10Repositório Institucional da UFSCAR - Universidade Federal de São Carlos (UFSCAR)falseTElDRU7Dh0EgREUgRElTVFJJQlVJw4fDg08gTsODTy1FWENMVVNJVkEKCkNvbSBhIGFwcmVzZW50YcOnw6NvIGRlc3RhIGxpY2Vuw6dhLCB2b2PDqiAobyBhdXRvciAoZXMpIG91IG8gdGl0dWxhciBkb3MgZGlyZWl0b3MgZGUgYXV0b3IpIGNvbmNlZGUgw6AgVW5pdmVyc2lkYWRlCkZlZGVyYWwgZGUgU8OjbyBDYXJsb3MgbyBkaXJlaXRvIG7Do28tZXhjbHVzaXZvIGRlIHJlcHJvZHV6aXIsICB0cmFkdXppciAoY29uZm9ybWUgZGVmaW5pZG8gYWJhaXhvKSwgZS9vdQpkaXN0cmlidWlyIGEgc3VhIHRlc2Ugb3UgZGlzc2VydGHDp8OjbyAoaW5jbHVpbmRvIG8gcmVzdW1vKSBwb3IgdG9kbyBvIG11bmRvIG5vIGZvcm1hdG8gaW1wcmVzc28gZSBlbGV0csO0bmljbyBlCmVtIHF1YWxxdWVyIG1laW8sIGluY2x1aW5kbyBvcyBmb3JtYXRvcyDDoXVkaW8gb3UgdsOtZGVvLgoKVm9jw6ogY29uY29yZGEgcXVlIGEgVUZTQ2FyIHBvZGUsIHNlbSBhbHRlcmFyIG8gY29udGXDumRvLCB0cmFuc3BvciBhIHN1YSB0ZXNlIG91IGRpc3NlcnRhw6fDo28KcGFyYSBxdWFscXVlciBtZWlvIG91IGZvcm1hdG8gcGFyYSBmaW5zIGRlIHByZXNlcnZhw6fDo28uCgpWb2PDqiB0YW1iw6ltIGNvbmNvcmRhIHF1ZSBhIFVGU0NhciBwb2RlIG1hbnRlciBtYWlzIGRlIHVtYSBjw7NwaWEgYSBzdWEgdGVzZSBvdQpkaXNzZXJ0YcOnw6NvIHBhcmEgZmlucyBkZSBzZWd1cmFuw6dhLCBiYWNrLXVwIGUgcHJlc2VydmHDp8Ojby4KClZvY8OqIGRlY2xhcmEgcXVlIGEgc3VhIHRlc2Ugb3UgZGlzc2VydGHDp8OjbyDDqSBvcmlnaW5hbCBlIHF1ZSB2b2PDqiB0ZW0gbyBwb2RlciBkZSBjb25jZWRlciBvcyBkaXJlaXRvcyBjb250aWRvcwpuZXN0YSBsaWNlbsOnYS4gVm9jw6ogdGFtYsOpbSBkZWNsYXJhIHF1ZSBvIGRlcMOzc2l0byBkYSBzdWEgdGVzZSBvdSBkaXNzZXJ0YcOnw6NvIG7Do28sIHF1ZSBzZWphIGRlIHNldQpjb25oZWNpbWVudG8sIGluZnJpbmdlIGRpcmVpdG9zIGF1dG9yYWlzIGRlIG5pbmd1w6ltLgoKQ2FzbyBhIHN1YSB0ZXNlIG91IGRpc3NlcnRhw6fDo28gY29udGVuaGEgbWF0ZXJpYWwgcXVlIHZvY8OqIG7Do28gcG9zc3VpIGEgdGl0dWxhcmlkYWRlIGRvcyBkaXJlaXRvcyBhdXRvcmFpcywgdm9jw6oKZGVjbGFyYSBxdWUgb2J0ZXZlIGEgcGVybWlzc8OjbyBpcnJlc3RyaXRhIGRvIGRldGVudG9yIGRvcyBkaXJlaXRvcyBhdXRvcmFpcyBwYXJhIGNvbmNlZGVyIMOgIFVGU0NhcgpvcyBkaXJlaXRvcyBhcHJlc2VudGFkb3MgbmVzdGEgbGljZW7Dp2EsIGUgcXVlIGVzc2UgbWF0ZXJpYWwgZGUgcHJvcHJpZWRhZGUgZGUgdGVyY2Vpcm9zIGVzdMOhIGNsYXJhbWVudGUKaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3Ugbm8gY29udGXDumRvIGRhIHRlc2Ugb3UgZGlzc2VydGHDp8OjbyBvcmEgZGVwb3NpdGFkYS4KCkNBU08gQSBURVNFIE9VIERJU1NFUlRBw4fDg08gT1JBIERFUE9TSVRBREEgVEVOSEEgU0lETyBSRVNVTFRBRE8gREUgVU0gUEFUUk9Dw41OSU8gT1UKQVBPSU8gREUgVU1BIEFHw4pOQ0lBIERFIEZPTUVOVE8gT1UgT1VUUk8gT1JHQU5JU01PIFFVRSBOw4NPIFNFSkEgQSBVRlNDYXIsClZPQ8OKIERFQ0xBUkEgUVVFIFJFU1BFSVRPVSBUT0RPUyBFIFFVQUlTUVVFUiBESVJFSVRPUyBERSBSRVZJU8ODTyBDT01PClRBTULDiU0gQVMgREVNQUlTIE9CUklHQcOHw5VFUyBFWElHSURBUyBQT1IgQ09OVFJBVE8gT1UgQUNPUkRPLgoKQSBVRlNDYXIgc2UgY29tcHJvbWV0ZSBhIGlkZW50aWZpY2FyIGNsYXJhbWVudGUgbyBzZXUgbm9tZSAocykgb3UgbyhzKSBub21lKHMpIGRvKHMpCmRldGVudG9yKGVzKSBkb3MgZGlyZWl0b3MgYXV0b3JhaXMgZGEgdGVzZSBvdSBkaXNzZXJ0YcOnw6NvLCBlIG7Do28gZmFyw6EgcXVhbHF1ZXIgYWx0ZXJhw6fDo28sIGFsw6ltIGRhcXVlbGFzCmNvbmNlZGlkYXMgcG9yIGVzdGEgbGljZW7Dp2EuCg== |
| dc.title.por.fl_str_mv |
Investigação de similaridade entre programas para apoiar o teste de mutação |
| dc.title.alternative.eng.fl_str_mv |
Investigation of program similarity to support mutation testing |
| title |
Investigação de similaridade entre programas para apoiar o teste de mutação |
| spellingShingle |
Investigação de similaridade entre programas para apoiar o teste de mutação Dallilo, Lucas Teste de software Análise de mutação Teste de mutação Técnicas de redução de custo Similaridade Clusterização One-Op Software test Mutation analysis Mutation test Cost re-duction techniques Similarity Clustering CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::METODOLOGIA E TECNICAS DA COMPUTACAO |
| title_short |
Investigação de similaridade entre programas para apoiar o teste de mutação |
| title_full |
Investigação de similaridade entre programas para apoiar o teste de mutação |
| title_fullStr |
Investigação de similaridade entre programas para apoiar o teste de mutação |
| title_full_unstemmed |
Investigação de similaridade entre programas para apoiar o teste de mutação |
| title_sort |
Investigação de similaridade entre programas para apoiar o teste de mutação |
| author |
Dallilo, Lucas |
| author_facet |
Dallilo, Lucas |
| author_role |
author |
| dc.contributor.authorlattes.por.fl_str_mv |
http://lattes.cnpq.br/5240609401895096 |
| dc.contributor.author.fl_str_mv |
Dallilo, Lucas |
| dc.contributor.advisor1.fl_str_mv |
Ferrari, Fabiano |
| dc.contributor.advisor1Lattes.fl_str_mv |
http://lattes.cnpq.br/3154345471250570 |
| dc.contributor.authorID.fl_str_mv |
69b6e939-458b-49ff-a50d-aa974ba0d3f0 |
| contributor_str_mv |
Ferrari, Fabiano |
| dc.subject.por.fl_str_mv |
Teste de software Análise de mutação Teste de mutação Técnicas de redução de custo Similaridade Clusterização |
| topic |
Teste de software Análise de mutação Teste de mutação Técnicas de redução de custo Similaridade Clusterização One-Op Software test Mutation analysis Mutation test Cost re-duction techniques Similarity Clustering CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::METODOLOGIA E TECNICAS DA COMPUTACAO |
| dc.subject.eng.fl_str_mv |
One-Op Software test Mutation analysis Mutation test Cost re-duction techniques Similarity Clustering |
| dc.subject.cnpq.fl_str_mv |
CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::METODOLOGIA E TECNICAS DA COMPUTACAO |
| description |
Context: The Mutation Analysis criterion – or, mutation testing – allows both the evaluation of test sets and the identification of faults present in the software. The criterion is considered effective, however has gaps in relation to its efficiency. Many cost reduction techniques have been presented however, the results yielded by these techniques are little generalizable to different groups of programs. Some studies in this context presented heuristics to calculate similarity between programs as a way to support cost reduction, but the calculation was not the central theme of the studies. Goals: This work investigated the similarity between programs, in the context of mutation testing of object-oriented programs, as primary information source to support the definition of a strategy to reduce the cost of the criterion. Methodology: The work included: (i) A literature research to characterize the similarity calculation in the presented context; (ii) The definition of a conceptual framework to apply similarity as a supportive technique for cost reduction strategies; and (iii) automation of the framework. The similarity is inferred through the clustering of CK metrics information. The tool also handles calculation and results from the employed cost reduction techniques; and (iv) An experiment and results analysis. Java classes were clustered and the values of mutation scores per operator of the classes and clusters were calculated. In the context of the One-Op cost reduction technique, the best candidate operators were compared between the generated groups and the classes individually. Results: As results, we have the description of similarity calculation in the presented context; a conceptual framework and respective support tool; and a experiment in 38 classes organized in 3 databases. Conclusion: The relevance of similarity was observed, thus allowing for further experiments involving operators obtained from similar programs to be applied to untested programs in the context of the criterion and strategy of cost reduction. |
| publishDate |
2019 |
| dc.date.accessioned.fl_str_mv |
2019-12-03T13:39:41Z |
| dc.date.available.fl_str_mv |
2019-12-03T13:39:41Z |
| dc.date.issued.fl_str_mv |
2019-05-20 |
| dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
| dc.type.driver.fl_str_mv |
info:eu-repo/semantics/masterThesis |
| format |
masterThesis |
| status_str |
publishedVersion |
| dc.identifier.citation.fl_str_mv |
DALLILO, Lucas. Investigação de similaridade entre programas para apoiar o teste de mutação. 2019. Dissertação (Mestrado em Ciência da Computação) – Universidade Federal de São Carlos, São Carlos, 2019. Disponível em: https://repositorio.ufscar.br/handle/20.500.14289/12095. |
| dc.identifier.uri.fl_str_mv |
https://repositorio.ufscar.br/handle/20.500.14289/12095 |
| identifier_str_mv |
DALLILO, Lucas. Investigação de similaridade entre programas para apoiar o teste de mutação. 2019. Dissertação (Mestrado em Ciência da Computação) – Universidade Federal de São Carlos, São Carlos, 2019. Disponível em: https://repositorio.ufscar.br/handle/20.500.14289/12095. |
| url |
https://repositorio.ufscar.br/handle/20.500.14289/12095 |
| dc.language.iso.fl_str_mv |
por |
| language |
por |
| dc.relation.confidence.fl_str_mv |
600 600 |
| dc.relation.authority.fl_str_mv |
c2f54b8f-f3f5-450e-9a5d-b847af844d31 |
| dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
| eu_rights_str_mv |
openAccess |
| dc.publisher.none.fl_str_mv |
Universidade Federal de São Carlos Câmpus São Carlos |
| dc.publisher.program.fl_str_mv |
Programa de Pós-Graduação em Ciência da Computação - PPGCC |
| dc.publisher.initials.fl_str_mv |
UFSCar |
| publisher.none.fl_str_mv |
Universidade Federal de São Carlos Câmpus São Carlos |
| dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFSCAR instname:Universidade Federal de São Carlos (UFSCAR) instacron:UFSCAR |
| instname_str |
Universidade Federal de São Carlos (UFSCAR) |
| instacron_str |
UFSCAR |
| institution |
UFSCAR |
| reponame_str |
Repositório Institucional da UFSCAR |
| collection |
Repositório Institucional da UFSCAR |
| bitstream.url.fl_str_mv |
https://repositorio.ufscar.br/bitstreams/b0b2b127-ba6e-4724-b3de-93a192813926/download https://repositorio.ufscar.br/bitstreams/384eaccd-e402-4603-be99-a16c3a961075/download https://repositorio.ufscar.br/bitstreams/38c88cca-73d3-4aba-9422-ebeb5ba9d635/download https://repositorio.ufscar.br/bitstreams/ec8be3b4-2e82-4b9e-ba6d-e452f556e1d1/download https://repositorio.ufscar.br/bitstreams/aea67767-931f-439d-9f61-58fea0db9590/download https://repositorio.ufscar.br/bitstreams/2ab7bad7-f899-4578-9a5f-04d688e5668e/download https://repositorio.ufscar.br/bitstreams/ccd5ccc4-21d7-4717-88a0-d0b0b4ae9321/download |
| bitstream.checksum.fl_str_mv |
7135d8182ec88374d8d71ff71f6ca58c 395078b2bce70ecea75cd80ebfd1fa03 ae0398b6f8b235e40ad82cba6c50031d f2a1ef8a5f61930be68755dd79fd46f3 bc6604f8e6d16095362e9b38d512138b 5c1ecc855e63d4a53e19aea754c4cc97 ce86b81dd824d6106ade7bfb80682085 |
| bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 MD5 MD5 MD5 MD5 |
| repository.name.fl_str_mv |
Repositório Institucional da UFSCAR - Universidade Federal de São Carlos (UFSCAR) |
| repository.mail.fl_str_mv |
repositorio.sibi@ufscar.br |
| _version_ |
1834469045102968832 |