{"title":"Figra","authors":"Alcides Fonseca, Máximo Oliveira","doi":"10.1145/3524459.3527345","DOIUrl":null,"url":null,"abstract":"Automatic Program Repair (APR) techniques have been used to automatically fix bugs, helping developers save time in this process. These techniques first identify where the error is located in the code, then iteratively apply patches to those locations, verifying if each patch succeeded in fixing the existing bug. This work focus on APR techniques that search for possible fixes, possibly based on information in the source code, and validate each fix based on test-suite, thus being a time-consuming search. In order to execute in reasonable time, existing techniques often trade-off reducing the search-space to be more efficient in finding the solution for some well-known classes of bugs. However, at the same time, other classes of bugs are being excluded from ever being fixed. This work focuses on evaluating the impact of this trade-off between the size of search-space and the time taken to find a valid patch. To this end, we have extended a state-of-the-art tool for Java automated repair, Cardumen, with a larger search space. Currently, Cardumen can replace target expressions with other expressions present elsewhere in the program. Our extension, Figra, also sup-ports the replacement to be new code, not already in the code. Figra detects four unique bugs that existing tools did not find in the same amount of time, and for the bugs that Cardumen was also able to solve, has identical performance in 5 out of 6 bugs.","PeriodicalId":339808,"journal":{"name":"Proceedings of the Third International Workshop on Automated Program Repair","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third International Workshop on Automated Program Repair","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3524459.3527345","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Automatic Program Repair (APR) techniques have been used to automatically fix bugs, helping developers save time in this process. These techniques first identify where the error is located in the code, then iteratively apply patches to those locations, verifying if each patch succeeded in fixing the existing bug. This work focus on APR techniques that search for possible fixes, possibly based on information in the source code, and validate each fix based on test-suite, thus being a time-consuming search. In order to execute in reasonable time, existing techniques often trade-off reducing the search-space to be more efficient in finding the solution for some well-known classes of bugs. However, at the same time, other classes of bugs are being excluded from ever being fixed. This work focuses on evaluating the impact of this trade-off between the size of search-space and the time taken to find a valid patch. To this end, we have extended a state-of-the-art tool for Java automated repair, Cardumen, with a larger search space. Currently, Cardumen can replace target expressions with other expressions present elsewhere in the program. Our extension, Figra, also sup-ports the replacement to be new code, not already in the code. Figra detects four unique bugs that existing tools did not find in the same amount of time, and for the bugs that Cardumen was also able to solve, has identical performance in 5 out of 6 bugs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Figra Proceedings of the Third International Workshop on Automated Program Repair
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1