skip to main content
10.1145/3524459.3527346acmconferencesArticle/Chapter ViewAbstractPublication PagesicseConference Proceedingsconference-collections
research-article

Be realistic: automated program repair is a combination of undecidable problems

Published:26 October 2022Publication History

ABSTRACT

Automated program repair (APR) tools have promising results, but what are APR's limits? The answer could help researchers design tool trade-offs and manage user expectations. Since APR is undecidable, as are two of its typical phases, tools must use conservative approximations. Such approximations can help APR tools be better understood and can lead to a theory of sound APR.

References

  1. Rastislav Bodík and Barbara Jobstmann. 2013. Algorithmic program synthesis: introduction. International journal on software tools for technology transfer 15, 5 (2013), 397--411.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Richard A DeMillo, Richard J Lipton, and Frederick G Sayward. 1978. Hints on test data selection: Help for the practicing programmer. Computer 11, 4 (1978), 34--41.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Thomas Durieux, Fernanda Madeiral, Matias Martinez, and Rui Abreu. 2019. Empirical review of Java program repair tools: A large-scale experiment on 2,141 bugs and 23,551 repair attempts. In Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. 302--313.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Luca Gazzola, Daniela Micucci, and Leonardo Mariani. 2017. Automatic software repair: A survey. IEEE Transactions on Software Engineering 45, 1 (2017), 34--67.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Kui Liu, Li Li, Anil Koyuncu, Dongsun Kim, Zhe Liu, Jacques Klein, and Tegawendé F Bissyandé. 2021. A critical review on the evaluation of automated program repair systems. Journal of Systems and Software 171 (2021), 110817.Google ScholarGoogle ScholarCross RefCross Ref
  6. Umang Mathur, P Madhusudan, and Mahesh Viswanathan. 2019. Decidable verification of uninterpreted programs. Proceedings of the ACM on Programming Languages 3, POPL (2019), 1--29.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Manish Motwani, Sandhya Sankaranarayanan, René Just, and Yuriy Brun. 2018. Do automated program repair techniques repair hard and important bugs? Empirical Software Engineering 23, 5 (2018), 2901--2947.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Amirfarhad Nilizadeh. 2022. Automated program repair and test overfitting: measurements and approaches using formal methods. In 2022 15th IEEE Conference on Software Testing, Verification and Validation (ICST) (In Press). IEEE.Google ScholarGoogle ScholarCross RefCross Ref
  9. Amirfarhad Nilizadeh, Marlon Calvo, Gary T. Leavens, and Xuan-Bach D. Le. 2021. More reliable test suites for dynamic APR by using counterexamples. In 2021 IEEE 32nd International Symposium on Software Reliability Engineering (ISSRE). IEEE, 208--219.Google ScholarGoogle Scholar
  10. Amirfarhad Nilizadeh, Gary T Leavens, Xuan-Bach D Le, Corina S Păsăreanu, and David R Cok. 2021. Exploring true test overfitting in dynamic automated program repair using formal methods. In 2021 14th IEEE Conference on Software Testing, Verification and Validation (ICST). IEEE, 229--240.Google ScholarGoogle ScholarCross RefCross Ref

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    APR '22: Proceedings of the Third International Workshop on Automated Program Repair
    May 2022
    83 pages
    ISBN:9781450392853
    DOI:10.1145/3524459

    Copyright © 2022 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 26 October 2022

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article

    Upcoming Conference

    ICSE 2025

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader