MURE:利用突变改进基于频谱的故障定位

Zijie Li, Lanfei Yan, Yuzhen Liu, Zhenyu Zhang, Bo Jiang
{"title":"MURE:利用突变改进基于频谱的故障定位","authors":"Zijie Li, Lanfei Yan, Yuzhen Liu, Zhenyu Zhang, Bo Jiang","doi":"10.1109/QRS-C.2018.00024","DOIUrl":null,"url":null,"abstract":"Locating faults in programs is never an easy task. Spectrum-based fault localization (SBFL) techniques estimate suspicious statements by contrasting the coverage spectra collected from passed and failed program runs. Mutation-based such techniques locate faults by trying different mutates with the aim of finding one that involves less turbulence to program behavior. The latter is empirically known more accurate, but with massive increases in time complexity. In this paper, we propose a new approach, MURE, which uses methodology of the latter to refine results of the former. MURE first drives a stateor-the-art SBFL technique Naish2 to output a list of suspicious statements. It then picks out suspicious statement as candidates, generates mutates for them, and estimates their likelihood of relating to faults. Finally, it refines the resultant list by adjusting part of its ordering. An experiment validates its effectiveness by showing a 30% accuracy improvement over Naish2.","PeriodicalId":199384,"journal":{"name":"2018 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"MURE: Making Use of MUtations to REfine Spectrum-Based Fault Localization\",\"authors\":\"Zijie Li, Lanfei Yan, Yuzhen Liu, Zhenyu Zhang, Bo Jiang\",\"doi\":\"10.1109/QRS-C.2018.00024\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Locating faults in programs is never an easy task. Spectrum-based fault localization (SBFL) techniques estimate suspicious statements by contrasting the coverage spectra collected from passed and failed program runs. Mutation-based such techniques locate faults by trying different mutates with the aim of finding one that involves less turbulence to program behavior. The latter is empirically known more accurate, but with massive increases in time complexity. In this paper, we propose a new approach, MURE, which uses methodology of the latter to refine results of the former. MURE first drives a stateor-the-art SBFL technique Naish2 to output a list of suspicious statements. It then picks out suspicious statement as candidates, generates mutates for them, and estimates their likelihood of relating to faults. Finally, it refines the resultant list by adjusting part of its ordering. An experiment validates its effectiveness by showing a 30% accuracy improvement over Naish2.\",\"PeriodicalId\":199384,\"journal\":{\"name\":\"2018 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)\",\"volume\":\"132 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/QRS-C.2018.00024\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/QRS-C.2018.00024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

定位程序中的故障从来不是一件容易的事。基于谱的故障定位(SBFL)技术通过对比从通过和失败的程序运行中收集的覆盖谱来估计可疑语句。基于突变的这类技术通过尝试不同的突变来定位故障,目的是找到一个对程序行为影响较小的突变。根据经验,后者更为准确,但时间复杂性会大幅增加。在本文中,我们提出了一种新的方法,MURE,它使用后者的方法来改进前者的结果。MURE首先驱动最先进的sffl技术Naish2来输出可疑语句列表。然后,它挑选出可疑的语句作为候选语句,为它们生成突变,并估计它们与错误相关的可能性。最后,它通过调整部分排序来细化结果列表。实验结果表明,该方法的精度比Naish2提高了30%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MURE: Making Use of MUtations to REfine Spectrum-Based Fault Localization
Locating faults in programs is never an easy task. Spectrum-based fault localization (SBFL) techniques estimate suspicious statements by contrasting the coverage spectra collected from passed and failed program runs. Mutation-based such techniques locate faults by trying different mutates with the aim of finding one that involves less turbulence to program behavior. The latter is empirically known more accurate, but with massive increases in time complexity. In this paper, we propose a new approach, MURE, which uses methodology of the latter to refine results of the former. MURE first drives a stateor-the-art SBFL technique Naish2 to output a list of suspicious statements. It then picks out suspicious statement as candidates, generates mutates for them, and estimates their likelihood of relating to faults. Finally, it refines the resultant list by adjusting part of its ordering. An experiment validates its effectiveness by showing a 30% accuracy improvement over Naish2.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信