Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs

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 ca...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on software engineering Ročník 43; číslo 1; s. 34 - 55
Hlavní autoři: Jifeng Xuan, Martinez, Matias, DeMarco, Favio, Clement, Maxime, Lamelas Marcote, Sebastian, Durieux, Thomas, Le Berre, Daniel, Monperrus, Martin
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.01.2017
IEEE Computer Society
Institute of Electrical and Electronics Engineers
Témata:
Automatic repair
Computer bugs
Computer Science
Debugging
Empirical analysis
Encoding
Expected values
fault localization
Indexes
Java
Maintenance engineering
Model testing
Object oriented programming
Open source software
patch generation
Repair
Runtime
SMT
Software Engineering
Software packages
Software testing
Studies
ISSN:0098-5589, 1939-3520
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 six 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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0098-5589
1939-3520
DOI:10.1109/TSE.2016.2560811