Current evaluations of automatic program repair (APR) techniques focus on tools' effectiveness, while little is known about the practical aspects of using APR tools, such as how long one should wait for a tool to generate a bug fix. In this work, we empirically study whether APR tools are any time algorithms (e.g., the more time they have, the more fixes they generate, so it makes sense to trade off longer time for better quality). Our preliminary experiment shows that the amount of plausible patches, given exponentially greater time, only increases linearly or not at all.
|Title of host publication||2021 IEEE/ACM International Workshop on Automated Program Repair (APR)|
|Subtitle of host publication||[Proceedings]|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||2|
|Publication status||Published - Jun 2021|
|Event||2nd IEEE/ACM International Workshop on Automated Program Repair, APR 2021 - Virtual, Online|
Duration: 22 May 2021 → 30 May 2021
|Conference||2nd IEEE/ACM International Workshop on Automated Program Repair, APR 2021|
|Period||22/05/21 → 30/05/21|
Bibliographical noteFunding Information:
This work was partly funded by the European Commission under the grants n. 952647 (H2020-AssureMOSS) and n.830929 (H2020-CyberSec4Europe).
© 2021 IEEE.
Copyright 2021 Elsevier B.V., All rights reserved.
- Anytime Algorithms
- Automated Program Repair
- Empirical Software Engineering