Correcting Instruction Expression Logic Errors with GenExp: A Genetic Programming Solution

M. Bekkouche
{"title":"Correcting Instruction Expression Logic Errors with GenExp: A Genetic Programming Solution","authors":"M. Bekkouche","doi":"10.56415/csjm.v31.12","DOIUrl":null,"url":null,"abstract":"Correcting logical errors in a program is not simple even with the availability of an error locating tool. In this article, we introduce GenExp, a genetic programming approach to automate the task of repairing instruction expressions from logical errors. \\correction{Starting} from an error location specified by the programmer, we search for a replacement instruction that passes all test cases. Specifically, we generate expressions that will substitute the selected instruction expression until \\correction{we} obtain one that \\correction{corrects} the input program. \\correction{The search space is exponentially large, making exhaustive methods inefficient.} \\correction{Therefore, we utilize a genetic programming meta-heuristic that organizes the search process into stages, with each stage producing a group of individuals.} The results showed that our approach can find at least one plausible patch for almost all cases considered in experiments and outperforms a notable state-of-the-art error repair approach \\correction{like} ASTOR. Although our tool is slower than ASTOR, it \\correction{provides} greater precision in detecting plausible repairs, making it a suitable option for users who prioritize accuracy over speed.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Comput. Sci. J. Moldova","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.56415/csjm.v31.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Correcting logical errors in a program is not simple even with the availability of an error locating tool. In this article, we introduce GenExp, a genetic programming approach to automate the task of repairing instruction expressions from logical errors. \correction{Starting} from an error location specified by the programmer, we search for a replacement instruction that passes all test cases. Specifically, we generate expressions that will substitute the selected instruction expression until \correction{we} obtain one that \correction{corrects} the input program. \correction{The search space is exponentially large, making exhaustive methods inefficient.} \correction{Therefore, we utilize a genetic programming meta-heuristic that organizes the search process into stages, with each stage producing a group of individuals.} The results showed that our approach can find at least one plausible patch for almost all cases considered in experiments and outperforms a notable state-of-the-art error repair approach \correction{like} ASTOR. Although our tool is slower than ASTOR, it \correction{provides} greater precision in detecting plausible repairs, making it a suitable option for users who prioritize accuracy over speed.
用GenExp修正指令表达式逻辑错误:一个遗传规划解决方案
即使有错误定位工具,纠正程序中的逻辑错误也不简单。在本文中,我们将介绍GenExp,这是一种用于自动修复指令表达式中的逻辑错误的遗传编程方法。从程序员指定的错误位置开始,我们搜索一条通过所有测试用例的替换指令。具体来说,我们生成的表达式将替换所选的指令表达式,直到\correction{we}得到\correction{更正}输入程序的表达式。\correction{搜索空间是指数级的,使得穷举方法效率低下。因此,我们利用遗传编程元启发式将搜索过程组织为阶段,每个阶段产生一组个体。结果表明,我们的方法可以在实验中考虑的几乎所有情况下找到至少一个合理的补丁,并且优于一个显着的最先进的错误修复方法\correction{例如}ASTOR。虽然我们的工具比ASTOR慢,但它在检测合理的修复方面提供了更高的精度,使其成为优先考虑准确性而不是速度的用户的合适选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信