Nopol: Automatic Repair of Conditional ...
Document type :
Article dans une revue scientifique: Article original
DOI :
Title :
Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs
Author(s) :
Xuan, Jifeng [Auteur]
Wuhan University [China]
Martinez, Matias [Auteur]
Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201 [LAMIH]
Self-adaptation for distributed services and large software systems [SPIRALS]
Université de Lille, Sciences et Technologies
Demarco, Favio [Auteur]
Universidad de Buenos Aires [Buenos Aires] [UBA]
Clément, Maxime [Auteur]
Université de Lille, Sciences et Technologies
Lamelas, Sebastian [Auteur]
Universidad de Buenos Aires [Buenos Aires] [UBA]
Durieux, Thomas [Auteur]
Self-adaptation for distributed services and large software systems [SPIRALS]
Université de Lille, Sciences et Technologies
Le Berre, Daniel [Auteur]
Centre de Recherche en Informatique de Lens [CRIL]
Monperrus, Martin [Auteur]
Université de Lille, Sciences et Technologies
Self-adaptation for distributed services and large software systems [SPIRALS]
Wuhan University [China]
Martinez, Matias [Auteur]
Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201 [LAMIH]
Self-adaptation for distributed services and large software systems [SPIRALS]
Université de Lille, Sciences et Technologies
Demarco, Favio [Auteur]
Universidad de Buenos Aires [Buenos Aires] [UBA]
Clément, Maxime [Auteur]
Université de Lille, Sciences et Technologies
Lamelas, Sebastian [Auteur]
Universidad de Buenos Aires [Buenos Aires] [UBA]
Durieux, Thomas [Auteur]
Self-adaptation for distributed services and large software systems [SPIRALS]
Université de Lille, Sciences et Technologies
Le Berre, Daniel [Auteur]
Centre de Recherche en Informatique de Lens [CRIL]
Monperrus, Martin [Auteur]
Université de Lille, Sciences et Technologies
Self-adaptation for distributed services and large software systems [SPIRALS]
Journal title :
IEEE Transactions on Software Engineering
Pages :
34-55
Publisher :
Institute of Electrical and Electronics Engineers
Publication date :
2017
ISSN :
0098-5589
HAL domain(s) :
Informatique [cs]/Génie logiciel [cs.SE]
English abstract : [en]
We propose NOPOL, an approach to automatic repair of buggy conditional statements (i.e., if-then-else statements). This approach takes a buggy program as well as a test suite as input and generates a patch with a conditional ...
Show more >We propose NOPOL, an approach to automatic repair of buggy conditional statements (i.e., if-then-else statements). This approach takes a buggy program as well as a test suite as input and generates a patch with a conditional expression as output. The test suite is required to contain passing test cases to model the expected behavior of the program and at least one failing test case that reveals the bug to be repaired. The process of NOPOL consists of three major phases. First, NOPOL employs angelic fix localization to identify expected values of a condition during the test execution. Second, runtime trace collection is used to collect variables and their actual values, including primitive data types and objected-oriented features (e.g., nullness checks), to serve as building blocks for patch generation. Third, NOPOL encodes these collected data into an instance of a Satisfiability Modulo Theory (SMT) problem; then a feasible solution to the SMT instance is translated back into a code patch. We evaluate NOPOL on 22 real-world bugs (16 bugs with buggy IF conditions and 6 bugs with missing preconditions) on two large open-source projects, namely Apache Commons Math and Apache Commons Lang. Empirical analysis on these bugs shows that our approach can effectively fix bugs with buggy IF conditions and missing preconditions. We illustrate the capabilities and limitations of NOPOL using case studies of real bug fixes.Show less >
Show more >We propose NOPOL, an approach to automatic repair of buggy conditional statements (i.e., if-then-else statements). This approach takes a buggy program as well as a test suite as input and generates a patch with a conditional expression as output. The test suite is required to contain passing test cases to model the expected behavior of the program and at least one failing test case that reveals the bug to be repaired. The process of NOPOL consists of three major phases. First, NOPOL employs angelic fix localization to identify expected values of a condition during the test execution. Second, runtime trace collection is used to collect variables and their actual values, including primitive data types and objected-oriented features (e.g., nullness checks), to serve as building blocks for patch generation. Third, NOPOL encodes these collected data into an instance of a Satisfiability Modulo Theory (SMT) problem; then a feasible solution to the SMT instance is translated back into a code patch. We evaluate NOPOL on 22 real-world bugs (16 bugs with buggy IF conditions and 6 bugs with missing preconditions) on two large open-source projects, namely Apache Commons Math and Apache Commons Lang. Empirical analysis on these bugs shows that our approach can effectively fix bugs with buggy IF conditions and missing preconditions. We illustrate the capabilities and limitations of NOPOL using case studies of real bug fixes.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.archives-ouvertes.fr/hal-01285008v2/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-01285008/file/nopol-experiments-master.zip
- Open access
- Access the document
- http://arxiv.org/pdf/1811.04211
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-01285008v2/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-01285008v2/document
- Open access
- Access the document
- document
- Open access
- Access the document
- nopol.pdf
- Open access
- Access the document
- nopol-experiments-master.zip
- Open access
- Access the document
- 1811.04211
- Open access
- Access the document