MintHint: automated synthesis of repair hints
Authors:
Open Access
- 31 May 2014
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 266-276
Abstract
Being able to automatically repair programs is at the same time a very compelling vision and an extremely challenging task. In this paper, we present MintHint, a novel technique for program repair that is a departure from most of today’s approaches. Instead of trying to fully automate program repair, which is often an unachievable goal, MintHint performs statistical correlation analysis to identify expressions that are likely to occur in the repaired code and generates, using pattern-matching based synthesis, repair hints from these expressions. Intuitively, these hints suggest how to rectify a faulty statement and help developers find a complete, actual repair. We also present an empirical evaluation of MintHint in two parts. The first part is a user study that shows that, when debugging, developers’ productivity improved manyfold with the use of repair hints—instead of traditional fault localization information alone. The second part consists of applying MintHint to several faults in Unix utilities to further assess the effectiveness of the approach. Our results show that MintHint performs well even in common situations where (1) the repair space searched does not contain the exact repair, and (2) the operational specification obtained from the test cases for repair is incomplete or even imprecise, which can be challenging for approaches aiming at fully automated repair.Keywords
All Related Versions
This publication has 30 references indexed in Scilit:
- Alternate and Learn: Finding Witnesses without Looking All overLecture Notes in Computer Science, 2012
- Compositional may-must program analysisACM SIGPLAN Notices, 2010
- Supporting Controlled Experimentation with Testing Techniques: An Infrastructure and its Potential ImpactEmpirical Software Engineering, 2005
- Programming by sketching for bit-streaming programs2005
- Locating causes of program failures2005
- Program Repair as a Game2005
- Fault localization with nearest neighbor queries2004
- Automated Debugging Using Path-Based Weakest Preconditions2004
- From symptom to causeACM SIGPLAN Notices, 2003
- On the editing distance between unordered labeled treesInformation Processing Letters, 1992