The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
History Driven Program Repair
Abstract
Effective automated program repair techniques have great potential to reduce the costs of debugging and maintenance. Previously proposed automated program repair (APR) techniques often follow a generate-and-validate and test-case-driven procedure: They first randomly generate a large pool of fix candidates and then exhaustively validate the quality of the candidates by testing them against existing or provided test suites. Unfortunately, many real-world bugs cannot be repaired by existing techniques even after more than 12 hours of computation in a multi-core cloud environment. More work is needed to advance the capabilities of modern APR techniques. We propose a new technique that utilizes the wealth of bug fixesacross projects in their development history to effectively guide and drive a programrepair process. Our main insight is that recurring bug fixes are common inreal-world applications, and that previously-appearing fix patterns canprovide useful guidance to an automated repair technique. Based on this insight, our technique first automaticallymines bug fix patterns from the history of many projects. We then employ existingmutation operators to generate fix candidates for a given buggy program. Candidates that match frequently occurring historical bug fixes are consideredmore likely to be relevant, and we thus give them priority inthe random search process. Finally, candidates thatpass all the previously failed test cases are recommended as likely fixes. We compare our technique against existinggenerate-and-validate and test-driven APR approaches using 90 bugs from 5 Javaprograms. The experiment results show that our technique can producegood-quality fixes for many more bugs as compared to the baselines, while beingreasonably computationally efficient: it takes less than 20minutes, on average, to correctly fix a bug.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Defects4J: a database of existing faults to enable controlled testing studies for Java programs
Just, R., Jalali, D., & Ernst, M. D. (2014) · Proceedings of the 2014 International Symposium on Software Testing and Analysis · doi:10.1145/2610384.2628055 · Cited by 1,447
Reducing bias and inefficiency in the selection algorithm
Baker, J. E. (1987) · international conference on Genetic algorithms · Cited by 1,415
GenProg: A Generic Method for Automatic Software Repair
Le Goues, C., Nguyen, T., Forrest, S., & Weimer, W. (2012) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2011.104 · Cited by 1,085
Self-citationDECKARD: Scalable and Accurate Tree-Based Detection of Code Clones
Jiang, L., Misherghi, G., Su, Z., & Glondu, S. (2007) · 29th International Conference on Software Engineering (ICSE'07) · doi:10.1109/icse.2007.30 · Cited by 1,039
Arcuri, A., & Briand, L. (2011) · Proceedings of the 33rd International Conference on Software Engineering · doi:10.1145/1985793.1985795 · Cited by 968
On the Accuracy of Spectrum-based Fault Localization
Abreu, R., Zoeteweij, P., & van Gemund, A. J. C. (2007) · Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (TAICPART-MUTATION 2007) · doi:10.1109/taic.part.2007.13 · Cited by 736
An experimental determination of sufficient mutant operators
Offutt, A. J., Lee, A., Rothermel, G., Untch, R. H., & Zapf, C. (1996) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/227607.227610 · Cited by 650
CloseGraph: mining closed frequent graph patterns
Yan, X., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956784 · Cited by 635
The Current State and Future of Search Based Software Engineering
Harman, M. (2007) · Future of Software Engineering (FOSE '07) · doi:10.1109/fose.2007.29 · Cited by 631
Fine-grained and accurate source code differencing
Falleri, J.-R., Morandat, F., Blanc, X., Martinez, M., & Monperrus, M. (2014) · Proceedings of the 29th ACM/IEEE International Conference on Automated Software Engineering · doi:10.1145/2642937.2642982 · Cited by 549
Bug isolation via remote program sampling
Liblit, B., Aiken, A., Zheng, A. X., & Jordan, M. I. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781148 · Cited by 504
Automatic patch generation learned from human-written patches
Kim, D., Nam, J., Song, J., & Kim, S. (2013) · 2013 35th International Conference on Software Engineering (ICSE) · doi:10.1109/icse.2013.6606626 · Cited by 449
Automatic patch generation learned from human-written patches
Kim, D., Nam, J., Song, J., & Kim, S. (2013) · Cited by 438
An analysis of patch plausibility and correctness for generate-and-validate patch generation systems
Qi, Z., Long, F., Achour, S., & Rinard, M. (2015) · Proceedings of the 2015 International Symposium on Software Testing and Analysis · doi:10.1145/2771783.2771791 · Cited by 420
Automatically patching errors in deployed software
Perkins, J. H., Kim, S., Larsen, S., Amarasinghe, S., Bachrach, J., Carbin, M., Pacheco, C., Sherwood, F., Sidiroglou, S., Sullivan, G., et al. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629585 · Cited by 409
SemFix: Program repair via semantic analysis
Nguyen, H. D. T., Qi, D., Roychoudhury, A., & Chandra, S. (2013) · 2013 35th International Conference on Software Engineering (ICSE) · doi:10.1109/icse.2013.6606623 · Cited by 395
A large scale study of programming languages and code quality in github
Ray, B., Posnett, D., Filkov, V., & Devanbu, P. (2014) · Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering · doi:10.1145/2635868.2635922 · Cited by 389
How Long Will It Take to Fix This Bug?
Weiss, C., Premraj, R., Zimmermann, T., & Zeller, A. (2007) · Fourth International Workshop on Mining Software Repositories (MSR'07:ICSE Workshops 2007) · doi:10.1109/msr.2007.13 · Cited by 375
Fair and balanced?: bias in bug-fix datasets
Bird, C., Bachmann, A., Aune, E., Duffy, J., Bernstein, A., Filkov, V., & Devanbu, P. (2009) · Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering · doi:10.1145/1595696.1595716 · Cited by 335
A systematic study of automated program repair: Fixing 55 out of 105 bugs for $8 each
Le Goues, C., Dewey-Vogt, M., Forrest, S., & Weimer, W. (2012) · 2012 34th International Conference on Software Engineering (ICSE) · doi:10.1109/icse.2012.6227211 · Cited by 326
Self-citationIs the cure worse than the disease? overfitting in automated program repair
Smith, E. K., Barr, E. T., Le Goues, C., & Brun, Y. (2015) · Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering · doi:10.1145/2786805.2786825 · Cited by 323
Hooimeijer, P., & Weimer, W. (2007) · Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering · doi:10.1145/1321631.1321639 · Cited by 317
The strength of random search on automated program repair
Qi, Y., Mao, X., Lei, Y., Dai, Z., & Wang, C. (2014) · Proceedings of the 36th International Conference on Software Engineering · doi:10.1145/2568225.2568254 · Cited by 303
The impact of tangled code changes
Herzig, K., & Zeller, A. (2013) · 2013 10th Working Conference on Mining Software Repositories (MSR) · doi:10.1109/msr.2013.6624018 · Cited by 270
Leveraging program equivalence for adaptive program repair: Models and first results
Weimer, W., Fry, Z. P., & Forrest, S. (2013) · 2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase.2013.6693094 · Cited by 266
Coping with an open bug repository
Anvik, J., Hiew, L., & Murphy, G. C. (2005) · Proceedings of the 2005 OOPSLA workshop on Eclipse technology eXchange - eclipse '05 · doi:10.1145/1117696.1117704 · Cited by 252
A novel co-evolutionary approach to automatic software bug fixing
Arcuri, A., & Yao, X. (2008) · 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) · doi:10.1109/cec.2008.4630793 · Cited by 250
DirectFix: Looking for Simple Program Repairs
Mechtaev, S., Yi, J., & Roychoudhury, A. (2015) · 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering · doi:10.1109/icse.2015.63 · Cited by 250
Using Mutation to Automatically Suggest Fixes for Faulty Programs
Debroy, V., & Wong, W. E. (2010) · 2010 Third International Conference on Software Testing, Verification and Validation · doi:10.1109/icst.2010.66 · Cited by 226
The plastic surgery hypothesis
Barr, E. T., Brun, Y., Devanbu, P., Harman, M., & Sarro, F. (2014) · Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering · doi:10.1145/2635868.2635898 · Cited by 215
Repairing Programs with Semantic Code Search (T)
Ke, Y., Stolee, K. T., Goues, C. L., & Brun, Y. (2015) · 2015 30th IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase.2015.60 · Cited by 192
Non-essential changes in version histories
Kawrykow, D., & Robillard, M. P. (2011) · Proceedings of the 33rd International Conference on Software Engineering · doi:10.1145/1985793.1985842 · Cited by 169
Monperrus, M. (2014) · Proceedings of the 36th International Conference on Software Engineering · doi:10.1145/2568225.2568324 · Cited by 166
Automated atomicity-violation fixing
Jin, G., Song, L., Zhang, W., Lu, S., & Liblit, B. (2011) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1993498.1993544 · Cited by 151
Countering Network Worms Through Automatic Patch Generation
Sidiroglou, S., & Keromytis, A. D. (2005) · IEEE Security & Privacy · doi:10.1109/msp.2005.144 · Cited by 136
DIRA: Automatic Detection, Identification and Repair of Control-Hijacking Attacks.
Смирнов, А. В., & Chiueh, T. (2005) · Cited by 105
The class-level mutants of MuJava
Offutt, J., Ma, Y., & Kwon, Y. R. (2006) · International Workshop on Automation of Software Test (AST) · doi:10.1145/1138929.1138945 · Cited by 92
Martínez, M., Weimer, W., & Monperrus, M. (2014) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/2591062.2591114 · Cited by 83
Martínez, M., Weimer, W. R., & Monperrus, M. (2014) · Cited by 81
Representations and operators for improving evolutionary software repair
Goues, C. L., Weimer, W. R., & Forrest, S. (2012) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2330163.2330296 · Cited by 74
Automatic Repair of Real Bugs: An Experience Report on the Defects4J Dataset
Martinez, M., Durieux, T., Xuan, J., Sommerard, R., & Monperrus, M. (2015) · arXiv · doi:10.48550/arxiv.1505.07002 · Cited by 47
Detecting and Escaping Infinite Loops with Jolt
Carbin, M., Misailovíc, S., Kling, M., & Rinard, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22655-7_28 · Cited by 38
Program transformations to fix C integers
Coker, Z., & Hafiz, M. (2013) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse.2013.6606625 · Cited by 38
Harman, M. (2010) · Communications of the ACM · doi:10.1145/1735223.1735248 · Cited by 33
Prophet: Automatic Patch Generation via Learning from Successful Human Patches
Long, F., & Rinard, M. (2015) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 16
Prophet: Automatic Patch Generation via Learning from Successful Patches
Long, F., & Rinard, M. (2015) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 6
Research works printed but not linked: 8
- 10.1145/781147.781148 · doi:10.1145/781147.781148
- 10.1145/1250734.1250736 · doi:10.1145/1250734.1250736
- 10.1109/ISSRE.2015.7381836 · DOI
- britton, 2013, Reversible debugging software, Tech Rep
- 10.1137/S009753970241096X · doi:10.1137/s009753970241096x
- bradbury, 2010, Automatic repair of concurrency bugs, International Symposium on Search Based Software Engineering (SSBSE) fast abstract
- tassey, 2002, The economic impacts of inadequate infrastructure for software testing, National Institute of Standards and Technology RTI Project, 7007
- 10.1145/2771783.2771791 · DOI · Paper page
Cited by
Automated Program Repair in the Era of Large Pre-trained Language Models
Xia, C. S., Wei, Y., & Zhang, L. (2023) · 2023 IEEE/ACM 45th International Conference on Software Engineering (ICSE) · doi:10.1109/icse48619.2023.00129 · Cited by 433
An Empirical Study on Learning Bug-Fixing Patches in the Wild via Neural Machine Translation
Tufano, M., Watson, C., Bavota, G., Penta, M. D., White, M., & Poshyvanyk, D. (2019) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3340544 · Cited by 370
CoCoNuT: combining context-aware neural translation models using ensemble for program repair
Lutellier, T., Pham, H. V., Pang, L., Li, Y., Wei, M., & Tan, L. (2020) · Proceedings of the 29th ACM SIGSOFT International Symposium on Software Testing and Analysis · doi:10.1145/3395363.3397369 · Cited by 344
DeepFL: integrating multiple fault diagnosis dimensions for deep fault localization
Li, X., Li, W., Zhang, Y., & Zhang, L. (2019) · Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis · doi:10.1145/3293882.3330574 · Cited by 336
Shaping program repair space with existing patches and similar code
Jiang, J., Xiong, Y., Zhang, H., Gao, Q., & Chen, X. (2018) · Proceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis · doi:10.1145/3213846.3213871 · Cited by 329
Metadata
- Authors
- Le, X. B. D., Lo, D., & Le Goues, C.
- Venue
- 2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER)
- Publisher
- IEEE
- Published
- 2016-03
- Pages
- 213-224
- OpenAlex
- W2400994325
- Cited by
- 332
- References
- 47
- FWCI
- 28.72
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.