Efficient Automated Program Repair through Fault-Recorded Testing Prioritization

Qi, Yuhua; Mao, Xiaoguang; Lei, Yan

doi:10.1109/icsm.2013.29

Cited by 74 publications

(82 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The uncorrected presence of incomplete or inaccurate information in the scientific literature hampers progress, especially when the results are visible, widely cited, and the foundation for additional research [40,15,32,39,25,9,33,12,31]. By providing a more complete understanding of the capabilities of prior automatic patch generation systems, this paper can help researchers better identify productive research directions.…”

Section: Contributionsmentioning

confidence: 99%

An analysis of patch plausibility and correctness for generate-and-validate patch generation systems

Long

Achour

et al. 2015

Proceedings of the 2015 International Symposium on Software Testing and Analysis

334

375

View full text Add to dashboard Cite

We analyze reported patches for three prior generate-andvalidate patch generation systems (GenProg, RSRepair, and AE). Because of experimental error, the majority of the reported patches violate the basic principle behind the design of these systems -they do not produce correct outputs even for the inputs in the test suite used to validate the patches. We also show that the overwhelming majority of the accepted patches are not correct and are equivalent to a single modification that simply deletes functionality.We also present Kali, a generate-and-validate patch generation system that simply deletes functionality. Working with a simpler and more effectively focused search space, Kali generates at least as many correct patches as prior GenProg, RSRepair, and AE systems. Kali also generates at least as many plausible patches that produce correct outputs for the inputs in the validation test suite as the three prior systems.We also discuss the patches produced by ClearView, a generate-and-validate binary hot patching system that leverages learned invariants to produce patches that enable systems to survive otherwise fatal defects and security attacks.

show abstract

Section: Contributionsmentioning

confidence: 99%

An analysis of patch plausibility and correctness for generate-and-validate patch generation systems

Long

Achour

et al. 2015

Proceedings of the 2015 International Symposium on Software Testing and Analysis

334

375

View full text Add to dashboard Cite

show abstract

“…A complementary approach to tackle the problem of the expanding search space is to reduce the cost of evaluating candidate patches, whether through test case prioritisation [17,18], test case sampling [4] or removal of redundant tests and (known) semantically equivalent mutants [23]. These approaches complement improved fault localisation for repair.…”

Section: Discussionmentioning

confidence: 99%

An Investigation into the Use of Mutation Analysis for Automated Program Repair

Timperley

Stepney

Goues

2017

Search Based Software Engineering

View full text Add to dashboard Cite

Abstract. Research in Search-Based Automated Program Repair has demonstrated promising results, but has nevertheless been largely confined to small, single-edit patches using a limited set of mutation operators. Tackling a broader spectrum of bugs will require multiple edits and a larger set of operators, leading to a combinatorial explosion of the search space. This motivates the need for more efficient search techniques. We propose to use the test case results of candidate patches to localise suitable fix locations. We analysed the test suite results of single-edit patches, generated from a random walk across 28 bugs in 6 programs. Based on the findings of this analysis, we propose a number of mutation-based fault localisation techniques, which we subsequently evaluate by measuring how accurately they locate the statements at which the search was able to generate a solution. After demonstrating that these techniques fail to result in a significant improvement, we discuss why this may be the case, despite the successes of mutation-based fault localisation in previous studies.

show abstract

“…This makes the technique timeconsuming. This situation gets worse when the program comes with a high number of test cases or the long-running ones [78]. Nevertheless, Le Goues et al explicitly stated that fitness evaluation using test cases is the dominant part of GenProg [9-11, 22, 34].…”

Section: Motivationmentioning

confidence: 98%

“…During the evolution of the faulty program towards the repaired one, it is necessary to validate the evolved program by rerunning all the regression test cases. This makes the repair process highly time-consuming especially when the program comes with many test cases or long-running test cases [78].…”

Section: Introductionmentioning

confidence: 99%

Automated program repair using genetic programming and model checking

2016

View full text Add to dashboard Cite

Automated program repair is still a highly challenging problem mainly due to the reliance of the current techniques on test cases to validate candidate patches. This leads to the increasing unreliability of the final patches since test cases are partial specifications of the software. In the present paper, an automated program repair method is proposed by integrating genetic programming (GP) and model checking (MC). Due to its capabilities to verify the finite state systems, MC is employed as an appropriate criterion for evolving programs to calculate the fitness in GP. The application of MC for the fitness evaluation, which is novel in the context of program repair, addresses an important gap in the current heuristic approaches to the program repair. Being focused on fault detection based on the desired aspects, it enables the programmers to detect faults according to the definition of properties. Creating a general method, this characteristic can be effectively customized for different domains of application and the corresponding faults. Apart from various types of faults, the proposed method is capable of handling concurrency bugs which are not the case in many general repair methods. To evaluate the proposed method, it was implemented as a tool, named JBF, to repair Java programs. To meet the objectives of the study, some experiments were conducted in which certain programs with known bugs were automatically repaired by the JBF tool. The obtained results are encouraging and remarkably promising.

show abstract

Efficient Automated Program Repair through Fault-Recorded Testing Prioritization

Cited by 74 publications

References 27 publications

An analysis of patch plausibility and correctness for generate-and-validate patch generation systems

An analysis of patch plausibility and correctness for generate-and-validate patch generation systems

An Investigation into the Use of Mutation Analysis for Automated Program Repair

Automated program repair using genetic programming and model checking

Contact Info

Product

Resources

About