2018

Learning Quick Fixes from Code Repositories

Rolim, Reudismam, Soares, Gustavo, Gheyi, Rohit et al.

Understand

Code analyzers such as Error Prone and FindBugs detect code patterns symptomatic of bugs, performance issues, or bad style.

These tools express patterns as quick fixes that detect and rewrite unwanted code.
However, it is difficult to come up with new quick fixes and decide which ones are useful and frequently appear in real code.
We propose to rely on the collective wisdom of programmers and learn quick fixes from revision histories in software repositories.

Built on

J. R. Landis and G. G. Koch, “The measurement of observer agreement for categorical data,” Biometrics , vol. 33, no. 1, pp. 159–174, 1977. [Online]. Available: http://www.jstor.org/stable/2529310
1977
Earlier work this paper cites.
Y. Benjamini and Y. Hochberg, “Controlling the false discovery rate: A practical and powerful approach to multiple testing,” Journal of the Royal Statistical Society. Series B (Methodological) , vol. 57, no. 1, pp. 289–300, 1995. [Online]. Available: http://www.jstor.org/stable/2346101
1995
Earlier work this paper cites.
W. S. Evans, C. W. Fraser, and F. Ma, “Clone detection via structural abstraction,” in Proceedings of 14th Working Conference on Reverse Engineering , ser. WCRE ’07. Piscataway, NJ, USA: IEEE Press, 2007, pp. 150–159
2007
Earlier work this paper cites.
N. Ayewah, D. Hovemeyer, J. D. Morgenthaler, J. Penix, and W. Pugh, “Using static analysis to find bugs,” IEEE Software , vol. 25, no. 5, pp. 22–29, Sep. 2008
2008
Earlier work this paper cites.
J. Andersen and J. L. Lawall, “Generic patch inference,” in Proceedings of the 23rd IEEE/ACM International Conference on Automated Software Engineering , ser. ASE ’08. Washington, DC, USA: IEEE Computer Society, 2008, pp. 337–346
2008
Earlier work this paper cites.
P. Bulychev and M. Minea, “An evaluation of duplicate code detection using anti-unification,” in Proceedings of the 3rd International Workshop OnSoftware Clones , ser. IWSC ’09. Kaiserslautern, Germany: Fraunhofer IESE, 2009, pp. 1–6
2009
Earlier work this paper cites.
D. Jeffrey, M. Feng, N. Gupta, and R. Gupta, “BugFix: A learning-based tool to assist developers in fixing bugs,” in Proceedings of the 2009 IEEE 17th International Conference on Program Comprehension , ser. ICPC ’09. Piscataway, NJ, USA: IEEE Press, 2009, pp. 70–79
2009
Earlier work this paper cites.
A. Bessey, K. Block, B. Chelf, A. Chou, B. Fulton, S. Hallem, C. Henri-Gros, A. Kamsky, S. McPeak, and D. Engler, “A few billion lines of code later: Using static analysis to find bugs in the real world,” Communications of the ACM , vol. 53, no. 2, pp. 66–75, 2010
2010
Earlier work this paper cites.
M. Gabel and Z. Su, “A study of the uniqueness of source code,” in Proceedings of the Eighteenth ACM SIGSOFT International Symposium on Foundations of Software Engineering , ser. FSE ’10. New York, NY, USA: ACM, 2010, pp. 147–156
2010
Earlier work this paper cites.
T. T. Nguyen, H. A. Nguyen, N. H. Pham, J. Al-Kofahi, and T. N. Nguyen, “Recurring bug fixes in object-oriented programs,” in Proceedings of the 32nd IEEE/ACM International Conference on Software Engineering - Volume 1 , ser. ICSE ’10. New York, NY, USA: ACM, 2010, pp. 315–324
2010
Earlier work this paper cites.
M. Kessentini, W. Kessentini, H. Sahraoui, M. Boukadoum, and A. Ouni, “Design defects detection and correction by example,” in Proceedings of the 19th IEEE International Conference on Program Comprehension , ser. ICPC ’11. Piscataway, NJ, USA: IEEE Press, 2011, pp. 81–90
2011
Earlier work this paper cites.
C. Povirk, “Google Guava,” 2012, https://github.com/google/guava/commit/8f48177
2012
Earlier work this paper cites.
A. Hindle, E. T. Barr, Z. Su, M. Gabel, and P. Devanbu, “On the naturalness of software,” in Proceedings of the 34th International Conference on Software Engineering , ser. ICSE ’12. Piscataway, NJ, USA: IEEE Press, 2012, pp. 837–847
2012
Earlier work this paper cites.
H. A. Nguyen, A. T. Nguyen, T. T. Nguyen, T. N. Nguyen, and H. Rajan, “A study of repetitiveness of code changes in software evolution,” in Proceedings of 28th the IEEE/ACM International Conference on Automated Software Engineering , ser. ASE ’13, New York, NY, USA, 2013, pp. 180–190
2013
Earlier work this paper cites.
J. L. Campbell, C. Quincy, J. Osserman, and O. K. Pedersen, “Coding in-depth semistructured interviews,” Sociological Methods & Research , vol. 42, no. 3, pp. 294–320, 2013
2013
Earlier work this paper cites.
L. Wasserman, “Scalable, example-based refactorings with Refaster,” in Proceedings of the 6th ACM Workshop on Workshop on Refactoring Tools , ser. WRT ’13. New York, NY, USA: ACM, 2013, pp. 25–28
2013
Earlier work this paper cites.

Similar

N. Meng, M. Kim, and K. S. McKinley, “LASE: Locating and applying systematic edits by learning from examples,” in Proceedings of the 35th International Conference on Software Engineering , ser. ICSE ’13. Piscataway, NJ, USA: IEEE Press, 2013, pp. 502–511
2013
Cited alongside, same era.
D. Kim, J. Nam, J. Song, and S. Kim, “Automatic patch generation learned from human-written patches,” in Proceedings of the 35th International Conference on Software Engineering , ser. ICSE ’13. Piscataway, NJ, USA: IEEE Press, 2013, pp. 802–811
2013
Cited alongside, same era.
C. Liu, J. Yang, L. Tan, and M. Hafiz, “R2fix: Automatically generating bug fixes from bug reports,” in 6th IEEE International Conference on Software Testing, Verification and Validation , ser. ICST ’13. Piscataway, NJ, USA: IEEE Press, 2013, pp. 282–291
2013
Cited alongside, same era.
J.-R. Falleri, F. Morandat, X. Blanc, M. Martinez, and M. Monperrus, “Fine-grained and accurate source code differencing,” in Proceedings of the 29th IEEE/ACM International Conference on Automated Software Engineering , ser. ASE ’14. New York, NY, USA: ACM, 2014, pp. 313–324
2014
Cited alongside, same era.
T. Kutsia, J. Levy, and M. Villaret, “Anti-unification for unranked terms and hedges,” Journal of Automated Reasoning , vol. 52, no. 2, pp. 155–190, Feb. 2014
2014
Cited alongside, same era.
S. Negara, M. Codoban, D. Dig, and R. E. Johnson, “Mining fine-grained code changes to detect unknown change patterns,” in Proceedings of the 36th International Conference on Software Engineering , ser. ICSE’14. New York, NY, USA: ACM, 2014, pp. 803–813
2014
Cited alongside, same era.
N. Meng, L. Hua, M. Kim, and K. S. McKinley, “Does automated refactoring obviate systematic editing?” in Proceedings of the 37th International Conference on Software Engineering - Volume 1 , ser. ICSE ’15. Piscataway, NJ, USA: IEEE Press, 2015, pp. 392–402
2015
Cited alongside, same era.
D. Silva, N. Tsantalis, and M. T. Valente, “Why we refactor? confessions of GitHub contributors,” in Foundations of Software Engineering (FSE) , 2016, pp. 858–870
2016
Cited alongside, same era.
F. Long and M. Rinard, “Automatic patch generation by learning correct code,” Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages , vol. 51, no. 1, pp. 298–312, 2016
2016
Cited alongside, same era.
A. Baumgartner and T. Kutsia, “Unranked second-order anti-unification,” Information and Computation , vol. 255, pp. 262 – 286, 2017
2017
Cited alongside, same era.
A. Baumgartner, T. Kutsia, J. Levy, and M. Villaret, “Higher-order pattern anti-unification in linear time,” Journal of Automated Reasoning , pp. 293–310, 2017. [Online]. Available: https://www3.risc.jku.at/projects/stout/software/hoau.php
2017
Cited alongside, same era.
T. Molderez, R. Stevens, and C. De Roover, “Mining change histories for unknown systematic edits,” in Proceedings of the 14th International Conference on Mining Software Repositories , ser. MSR ’17. Piscataway, NJ, USA: IEEE Press, 2017, pp. 248–256
2017
Cited alongside, same era.

Then

JetBrains, “ReSharper,” 2018, at https://www.jetbrains.com/resharper/
2018
Closest in time.
PMD, “PMD: an extensible cross-language static code analyzer.” 2018, at https://pmd.github.io/
2018
Closest in time.
Checkstyle, “Checkstyle project,” 2018, at http://checkstyle.sourceforge.net/
2018
Closest in time.
Oracle, “Class ConcurrentSkipListSet<E>,” 2018, at https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/ConcurrentSkipListSet.html
2018
Closest in time.
Eclipse, “Eclipse JDT,” 2018, at https://www.eclipse.org/jdt/
2018
Closest in time.
JGit, “Eclipse JGit,” 2018, at https://www.eclipse.org/jgit/
2018
Closest in time.
DZone, “FileInputStream / FileOutputStream Considered Harmful,” 2017, at https://dzone.com/articles/fileinputstream-fileoutputstream-considered-harmful
2018
Closest in time.
J. JDK, “Relax FileInputStream/FileOutputStream requirement to use finalize,” 2018, at https://bugs.openjdk.java.net/browse/JDK-8187325
2018
Closest in time.
Oracle, “Class StringBuilder,” 2018, at https://docs.oracle.com/javase/8/docs/api/java/lang/StringBuilder.html
2018
Closest in time.
——, “Type inference for generic instance creation,” 2018, at https://docs.oracle.com/javase/7/docs/technotes/guides/language/type-inference-generic-instance-creation.html
2018
Closest in time.
Oracle Java Documentation, “Raw Types,” 2018, at https://docs.oracle.com/javase/tutorial/java/generics/rawTypes.html
2018
Closest in time.
J. Practices, “Use final liberally,” 2018, at http://www.javapractices.com/topic/TopicAction.do?Id=23
2018
Closest in time.
T. E. Foundation, “Eclipse,” 2018, at https://eclipse.org/
2018
Closest in time.
NetBeans IDE, “Netbeans ide,” 2018, at https://netbeans.org/
2018
Closest in time.
X. Liu and H. Zhong, “Mining StackOverflow for Program Repair,” in 25th Edition of IEEE International Conference on Software Analysis, Evolution and Reengineering , ser. SANER ’18, 2018, p. to appear
2018
Closest in time.
V. Sobreira, T. Durieux, F. Madeiral, M. Monperrus, and M. A. Maia, “Dissection of a Bug Dataset: Anatomy of 395 Patches from Defects4J,” in 25th edition of IEEE International Conference on Software Analysis, Evolution and Reengineering , ser. SANER ’18, 2018, p. to appear
2018
Closest in time.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

Reading the bibliography…