Abstract:

Research in Search-Based Automated Program Repair has demonstrated promising results, but has nevertheless been largely confined to small, single-edit patches using a limited set of mutation operators. Tackling a broader spectrum of bugs will require multiple edits and a larger set of operators, leading to a combinatorial explosion of the search space. This motivates the need for more efficient search techniques. We propose to use the test case results of candidate patches to localise suitable fix locations. We analysed the test suite results of single-edit patches, generated from a random walk across 28 bugs in 6 programs. Based on the findings of this analysis, we propose a number of mutation-based fault localisation techniques, which we subsequently evaluate by measuring how accurately they locate the statements at which the search was able to generate a solution. After demonstrating that these techniques fail to result in a significant improvement, we discuss why this may be the case, despite the successes of mutation-based fault localisation in previous studies.

@inproceedings(Timperley2017:SSBSE,
  author = "Christopher S. Timperley and Susan Stepney and Claire {Le Goues}",
  title = "An Investigation into the Use of Mutation Analysis for Automated Program Repair",
  pages = "99-114", 
  doi = "10.1007/978-3-319-66299-2_7",  
  crossref = "SSBSE-2017"
)

@proceedings(SSBSE-2017,
  title = "SSBSE'17, Paderborn, Germany, September 2017",
  booktitle = "SSBSE'17, Paderborn, Germany, September 2017",
  series = "LNCS",
  volume = 10452,
  publisher = "Springer",
  year = 2017
)