2016 IEEE International Conference on Software Maintenance and Evolution (ICSME) 2016
DOI: 10.1109/icsme.2016.66
|View full text |Cite
|
Sign up to set email alerts
|

Enhancing Automated Program Repair with Deductive Verification

Abstract: Abstract-Automated program repair (APR) is a challenging process of detecting bugs, localizing buggy code, generating fix candidates and validating the fixes. Effectiveness of program repair methods relies on the generated fix candidates, and the methods used to traverse the space of generated candidates to search for the best ones. Existing approaches generate fix candidates based on either syntactic searches over source code or semantic analysis of specification, e.g., test cases. In this paper, we propose t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
3
2

Relationship

3
6

Authors

Journals

citations
Cited by 34 publications
(21 citation statements)
references
References 27 publications
0
21
0
Order By: Relevance
“…8 Possible null pointer dereference. 9 Dead store to a local variable. 10 A private method is never called.…”
Section: Applying Avatar To Statically-detected Bugs In Defects4jmentioning
confidence: 99%
“…8 Possible null pointer dereference. 9 Dead store to a local variable. 10 A private method is never called.…”
Section: Applying Avatar To Statically-detected Bugs In Defects4jmentioning
confidence: 99%
“…Third Experiment Although having a specification language based on separation logic allows us to precisely specify preconditions of the programs under test and generate valid test inputs, it could be non-trivial for ordinary users to use such a language. This problem has been recognized by the community and there have been multiple approaches to solve this problem [2,27,31,39]. One noticeable example which has made industrial impact is the Infer static analyzer [2], which infers preconditions of programs through bi-abduction [13].…”
Section: Rq1: Does Csf Generate Valid Test Inputs?mentioning
confidence: 99%
“…Mechtaev et al propose Angelix that can fix bugs using semantics analysis and program synthesis [21]. Subsequently, Le et al propose to use syntax-guided synthesis [15] and deductive verification [13] for program repair. However, even state-ofthe-art approaches can only fix a small number of bugs whose fixes span one or a few lines of code.…”
Section: Related Workmentioning
confidence: 99%