By the same authors

Empirical Analysis of 1-edit Degree Patches in Syntax-Based Automatic Program Repair

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Standard

Empirical Analysis of 1-edit Degree Patches in Syntax-Based Automatic Program Repair. / Dziurzanski, Piotr; Gerasimou, Simos; Kolovos, Dimitris; Matragkas, Nikolaos.

IEEE Congress on Evolutionary Computation. 2020.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Harvard

Dziurzanski, P, Gerasimou, S, Kolovos, D & Matragkas, N 2020, Empirical Analysis of 1-edit Degree Patches in Syntax-Based Automatic Program Repair. in IEEE Congress on Evolutionary Computation.

APA

Dziurzanski, P., Gerasimou, S., Kolovos, D., & Matragkas, N. (Accepted/In press). Empirical Analysis of 1-edit Degree Patches in Syntax-Based Automatic Program Repair. In IEEE Congress on Evolutionary Computation

Vancouver

Dziurzanski P, Gerasimou S, Kolovos D, Matragkas N. Empirical Analysis of 1-edit Degree Patches in Syntax-Based Automatic Program Repair. In IEEE Congress on Evolutionary Computation. 2020

Author

Dziurzanski, Piotr ; Gerasimou, Simos ; Kolovos, Dimitris ; Matragkas, Nikolaos. / Empirical Analysis of 1-edit Degree Patches in Syntax-Based Automatic Program Repair. IEEE Congress on Evolutionary Computation. 2020.

Bibtex - Download

@inproceedings{83213662369142ce804e0fc8c524f2f8,
title = "Empirical Analysis of 1-edit Degree Patches in Syntax-Based Automatic Program Repair",
abstract = "In this paper, software patches modifying a single line (aka 1-edit degree patches) of buggy Java open-source projects have been generated automatically using computational search and experimentally evaluated. We carried out the presumably largest to date experiment related to 1-edit degree patches, consisting of almost 27,000 computational jobs upper bounded with 107,000 computational hours. Our experiments show the benefits and drawbacks of such kind of patches. In particular, the search space size has been shown to be reduced by several orders of magnitude. The volume of tests that can be filtered out without any negative impact while generating 1-edit degree patches has been increased by about 97%. Finally, the effectiveness of finding 1-edit plausible patches is compared with multi-line plausible patches found with state-of-the-art syntax-based Automatic Program Repair tools. It is shown that despite patching fewer bugs in total, 1-edit degree patches have potential to patch some extra bugs.",
author = "Piotr Dziurzanski and Simos Gerasimou and Dimitris Kolovos and Nikolaos Matragkas",
year = "2020",
month = mar,
day = "20",
language = "English",
booktitle = "IEEE Congress on Evolutionary Computation",

}

RIS (suitable for import to EndNote) - Download

TY - GEN

T1 - Empirical Analysis of 1-edit Degree Patches in Syntax-Based Automatic Program Repair

AU - Dziurzanski, Piotr

AU - Gerasimou, Simos

AU - Kolovos, Dimitris

AU - Matragkas, Nikolaos

PY - 2020/3/20

Y1 - 2020/3/20

N2 - In this paper, software patches modifying a single line (aka 1-edit degree patches) of buggy Java open-source projects have been generated automatically using computational search and experimentally evaluated. We carried out the presumably largest to date experiment related to 1-edit degree patches, consisting of almost 27,000 computational jobs upper bounded with 107,000 computational hours. Our experiments show the benefits and drawbacks of such kind of patches. In particular, the search space size has been shown to be reduced by several orders of magnitude. The volume of tests that can be filtered out without any negative impact while generating 1-edit degree patches has been increased by about 97%. Finally, the effectiveness of finding 1-edit plausible patches is compared with multi-line plausible patches found with state-of-the-art syntax-based Automatic Program Repair tools. It is shown that despite patching fewer bugs in total, 1-edit degree patches have potential to patch some extra bugs.

AB - In this paper, software patches modifying a single line (aka 1-edit degree patches) of buggy Java open-source projects have been generated automatically using computational search and experimentally evaluated. We carried out the presumably largest to date experiment related to 1-edit degree patches, consisting of almost 27,000 computational jobs upper bounded with 107,000 computational hours. Our experiments show the benefits and drawbacks of such kind of patches. In particular, the search space size has been shown to be reduced by several orders of magnitude. The volume of tests that can be filtered out without any negative impact while generating 1-edit degree patches has been increased by about 97%. Finally, the effectiveness of finding 1-edit plausible patches is compared with multi-line plausible patches found with state-of-the-art syntax-based Automatic Program Repair tools. It is shown that despite patching fewer bugs in total, 1-edit degree patches have potential to patch some extra bugs.

M3 - Conference contribution

BT - IEEE Congress on Evolutionary Computation

ER -