[ICSE 2019] Harnessing Evolution for Multi-Hunk Program Repair

最新推荐文章于 2024-12-24 11:56:43 发布

原创最新推荐文章于 2024-12-24 11:56:43 发布 · 738 阅读

1 ·

CC 4.0 BY-SA版权

研二下专栏收录该内容

60 篇文章

订阅专栏

本文介绍了一种新颖的自动程序修复技术，该技术针对需要在多个位置进行编辑的多块bug，通过识别相似代码片段（进化兄弟）并同步修复，显著提高了修复成功率。在Defects4J数据集上，名为Hercules的工具成功修复了49个bug，包括15个多块bug，展示了其在多块程序修复领域的有效性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

文章目录

标题：[ICSE 2019] Harnessing Evolution for Multi-Hunk Program Repair

前言

本文旨在阅读 ICSE 2019 文章 —— Harnessing Evolution for Multi-Hunk Program Repair。

基本信息

Saha, S., Saha, R. K., & Prasad, M. R. (2019, May). Harnessing evolution for multi-hunk program repair. In Proceedings of the 41st International Conference on Software Engineering (pp. 13-24). IEEE Press.

很牛，ICSE

Mukul R. Prasad 作者，还是以下文章的作者：

Shin Hwei Tan, Hiroaki Yoshida, Mukul R. Prasad, and Abhik Roychoudhury. 2016. Anti-patterns in Search-based Program Repair. In Proceedings ofthe 2016 24th ACM SIGSOFT International Symposium on Foundations ofSoftware Engineering (FSE 2016). ACM, New York, NY, USA, 727–738.
Ripon K. Saha, Yingjun Lyu, Hiroaki Yoshida, and Mukul R. Prasad. 2017. ELIXIR: Effective Object Oriented Program Repair. In Proceedings ofthe 32Nd IEEE/ACM International Conference on Automated Software Engineering (ASE 2017). IEEE Press, Piscataway, NJ, USA, 648–659.
RiponK Saha, Yingjun Lyu, Wing Lam, Hiroaki Yoshida, and Mukul R Prasad. 2018. Bugs. jar: a large-scale, diverse dataset of real-world Java bugs. In Proceedings of the 15th International Conference on Mining Software Repositories. ACM, 10–13.

基本内容

Despite significant advances in automatic program repair (APR) techniques over the past decade, practical deployment remains an elusive goal. One of the important challenges in this regard is the general inability of current APR techniques to produce patches that require edits in multiple locations, i.e., multi-hunk patches.

当前的APR现状。

In this work, we present a novel APR technique that generalizes single- hunk repair techniques to include an important class of multi-hunk bugs, namely bugs that may require applying a substantially similar patch at a number oflocations.We term such sets ofrepair locations as evolutionary siblings – similar looking code, instantiated in sim- ilar contexts, that are expected to undergo similar changes. At the heart of our proposed method is an analysis to accurately identify a set of evolutionary siblings, for a given bug. This analysis lever- ages three distinct sources of information, namely the test-suite spectrum, a novel code similarity analysis, and the revision history of the project.

具体的技术。

The discovered siblings are then simultaneously re- paired in a similar fashion. We instantiate this technique in a tool called Hercules and demonstrate that it is able to correctly fix 49 bugs in the Defects4J dataset, the highest of any individual APR technique to date. This includes 15 multi-hunk bugs and overall 13 bugs which have not been fixed by any other technique so far.

实验效果还不错。

以上为摘要。

idea来源

在这里插入图片描述

亮点

1）作者有水平，既然现阶段解决不了general的problem，那就解决specific problem。
思路很灵活：

In this work, we propose an APR technique that targets a specific but important class of multi-hunk repair problems.

2）作者的调研很充分，感觉是code clone的大牛一样，很多年前的文章都知道。

3）写作水平很高

在这里插入图片描述
很强，测试用例增强。

5）贡献这里，注意表述的格式就好。
在这里插入图片描述

不足

1）我认为是三个热点的结合？

在这里插入图片描述

软工需要ML技术。最近很多会议似乎都开设了相关的 ML-related 论坛。
可以预见，未来会有更多的机器学习技术涌入软件工程领域。

更多请见：我的印象笔记。

好词好句（At least 10）

Our solution is broadly inspired by insights from two bodies of research.
Specifically, while the technique is essentially unchanged from [39], some bug-fixes in the implemen- tation led to Hercules generating some new patches, both correct and incorrect, which is reflected in the results reported in Section 6.
These two bodies of work point to the phenomenon that it is plausible to find “similar looking" pieces of code across a project, bearing similar kinds of bugs and warranting similar patches. Our work exploits this general insight as well
At the heart of our proposed method is an analysis that uses three distinct sources of information to accurately identify evo- lutionary siblings suitable for repair, for the bug at hand. First,
implicate
a starting reference for
modulo namespace variations
It is noteworthy that, although not specifically discussed in [46] or [11], the （这样的文献引用还是有人用的嘛）
By contrast, our approach is much more general, exploiting the sibling relationship to keep the search space effectively the same as a single-location patch.