Harnessing Evolution for Multi-Hunk Program Repair.

Saved in:
Bibliographic Details
Title: Harnessing Evolution for Multi-Hunk Program Repair.
Authors: Saha, Seemanta1 seemantasaha@cs.ucsb.edu, Saha, Ripon K.2 rsaha@us.fujitsu.com, Prasad, Mukul R.2 mukul@us.fujitsu.com
Source: ICSE: International Conference on Software Engineering. 5/25/2019, p13-24. 12p.
Subjects: Automatic programming (Computer science), Software maintenance, Software engineering, Artificial intelligence, Big data
Abstract: 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. 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 of locations. We term such sets of repair locations as evolutionary siblings -- similar looking code, instantiated in similar 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 leverages 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 repaired in a similar fashion. We instantiate this technique in a tool called HERCULES and demonstrate that it is able to correctly fix 46 bugs in the Defects4J dataset, the highest of any individual APR technique to date. This includes 15 multihunk bugs and overall 11 bugs which have not been fixed by any other technique so far. [ABSTRACT FROM AUTHOR]
Copyright of ICSE: International Conference on Software Engineering is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Be the first to leave a comment!
You must be logged in first