Home > Research > Publications & Outputs > Exploiting fault localisation for efficient pro...

Links

Text available via DOI:

View graph of relations

Exploiting fault localisation for efficient program repair: 2020 Genetic and Evolutionary Computation Conference, GECCO 2020

Research output: Contribution to conference - Without ISBN/ISSN Conference paperpeer-review

Published
Publication date8/07/2020
Number of pages2
Pages311-312
<mark>Original language</mark>English
Event2020 Genetic and Evolutionary Computation Conference, GECCO 2020 - Cancun; Mexico, Cancun, Mexico
Duration: 8/07/202012/07/2020
Conference number: 161684

Conference

Conference2020 Genetic and Evolutionary Computation Conference, GECCO 2020
Country/TerritoryMexico
CityCancun
Period8/07/2012/07/20

Abstract

Search-based program repair generates variants of a defective program to find its repair. This could reduce the time and effort necessary for the manual software development and maintenance. However, applying even a limited set of mutations on a small piece of code (that repairs only trivial defects) generates a huge number of possible program variants (also called a search space). The reduction of the search space, while preserving the number and quality of repairs, would make these tools more efficient and practical. We present an end-to-end repair tool for Java programs. It localises lines of source code that introduced a defect into the history of the program's development and applies a set of mutations targeting only these lines. In the reduced search space, our tool repaired defects covered by failing tests in an open-source Java program. © 2020 Owner/Author.