2018

Learning to Generate Corrective Patches using Neural Machine Translation

Hata, Hideaki, Shihab, Emad, Neubig, Graham

Understand

Bug fixing is generally a manually-intensive task.

However, recent work has proposed the idea of automated program repair, which aims to repair (at least a subset of) bugs in different ways such as code mutation, etc.
Following in the same line of work as automated bug repair, in this paper we aim to leverage past fixes to propose fixes of current/future bugs.
Specifically, we propose Ratchet, a corrective patch generation system using neural machine translation.

Built on

Z. Chen, S. Kommrusch, M. Tufano, L. Pouchet, D. Poshyvanyk, and M. Monperrus, “Sequencer: Sequence-to-sequence learning for end-to-end program repair,” CoRR , vol. abs/1901.01808, 2019. [Online]. Available: http://arxiv.org/abs/1901.01808
Original
1901
Earlier work this paper cites.
D. E. Rumelhart, G. E. Hinton, and R. J. Williams, “Learning representations by back-propagating errors,” Cognitive modeling , vol. 5, no. 3, p. 1, 1988
1988
Earlier work this paper cites.
K. Hornik, M. Stinchcombe, and H. White, “Multilayer feedforward networks are universal approximators,” Neural networks , vol. 2, no. 5, pp. 359–366, 1989
1989
Earlier work this paper cites.
S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural computation , vol. 9, no. 8, pp. 1735–1780, 1997
1997
Earlier work this paper cites.
J. Śliwerski, T. Zimmermann, and A. Zeller, “When do changes induce fixes?” in Proc. of 2nd Int. Workshop on Mining Softw. Repositories , ser. MSR ’05. New York, NY, USA: ACM, 2005, pp. 1–5. [Online]. Available: http://doi.acm.org/10.1145/1082983.1083147
2005
Earlier work this paper cites.
S. Kim, K. Pan, and E. E. J. Whitehead, Jr., “Memories of bug fixes,” in Proc. of 14th ACM SIGSOFT Int. Symp. on Found. of Softw. Eng. , ser. SIGSOFT ’06/FSE-14. New York, NY, USA: ACM, 2006, pp. 35–45. [Online]. Available: http://doi.acm.org/10.1145/1181775.1181781
2006
Earlier work this paper cites.
O. Mizuno and T. Kikuno, “Training on errors experiment to detect fault-prone software modules by spam filter,” in Proc. of 6th Joint Meeting of the European Softw. Eng. Conf. and the ACM SIGSOFT Symp. on the Found. of Softw. Eng. , ser. ESEC-FSE ’07. New York, NY, USA: ACM, 2007, pp. 405–414. [Online]. Available: http://doi.acm.org/10.1145/1287624.1287683
2007
Earlier work this paper cites.
A. Alali, H. Kagdi, and J. I. Maletic, “What’s a typical commit? a characterization of open source software repositories,” in 2008 16th IEEE International Conference on Program Comprehension , June 2008, pp. 182–191
2008
Earlier work this paper cites.
H. Hata, O. Mizuno, and T. Kikuno, “An extension of fault-prone filtering using precise training and a dynamic threshold,” in Proc. of 5th Work. Conf. on Mining Softw. Repositories , ser. MSR ’08. New York, NY, USA: ACM, 2008, pp. 89–98. [Online]. Available: http://doi.acm.org/10.1145/1370750.1370772
2008
Earlier work this paper cites.
S. Kim, E. J. Whitehead, Jr., and Y. Zhang, “Classifying software changes: Clean or buggy?” IEEE Trans. Softw. Eng. , vol. 34, pp. 181–196, March 2008. [Online]. Available: http://portal.acm.org/citation.cfm?id=1399105.1399451
2008
Earlier work this paper cites.
O. Arafat and D. Riehle, “The commit size distribution of open source software,” in 2009 42nd Hawaii International Conference on System Sciences , Jan 2009, pp. 1–8
2009
Earlier work this paper cites.
P. Koehn, Statistical Machine Translation . Cambridge Press, 2010
2010
Earlier work this paper cites.
H. Hata, O. Mizuno, and T. Kikuno, “Fault-prone module detection using large-scale text features based on spam filtering,” Empirical Softw. Eng. , vol. 15, pp. 147–165, April 2010. [Online]. Available: http://dx.doi.org/10.1007/s10664-009-9117-9
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 Proc. of 32nd Int. Conf. on Softw. Eng. , ser. ICSE ’10. New York, NY, USA: ACM, 2010, pp. 315–324. [Online]. Available: http://doi.acm.org/10.1145/1806799.1806847
2010
Earlier work this paper cites.
C. Le Goues, T. Nguyen, S. Forrest, and W. Weimer, “Genprog: A generic method for automatic software repair,” IEEE Trans. Softw. Eng. , vol. 38, no. 1, pp. 54–72, Jan. 2012. [Online]. Available: http://dx.doi.org/10.1109/TSE.2011.104
2011
Earlier work this paper cites.
R. Socher, E. H. Huang, J. Pennin, C. D. Manning, and A. Y. Ng, “Dynamic pooling and unfolding recursive autoencoders for paraphrase detection,” in Proceedings of the 25th Annual Conference on Neural Information Processing Systems (NIPS) , 2011, pp. 801–809
2011
Earlier work this paper cites.
H. Hata, O. Mizuno, and T. Kikuno, “Historage: Fine-grained version control system for Java,” in Proc. of 3rd Joint Int. and Annual ERCIM Workshops on Principles of Softw. Evolution and Softw. Evolution Workshops , ser. IWPSE-EVOL ’11. New York, NY, USA: ACM, 2011, pp. 96–100. [Online]. Available: http://doi.acm.org/10.1145/2024445.2024463
2011
Earlier work this paper cites.
C. Le Goues, M. Dewey-Vogt, S. Forrest, and W. Weimer, “A systematic study of automated program repair: Fixing 55 out of 105 bugs for $8 each,” in Proc. of 34th Int. Conf. on Softw. Eng. , ser. ICSE ’12. Piscataway, NJ, USA: IEEE Press, 2012, pp. 3–13. [Online]. Available: http://dl.acm.org/citation.cfm?id=2337223.2337225
2012
Earlier work this paper cites.
P. Liu and C. Zhang, “Axis: Automatically fixing atomicity violations through solving control constraints,” in Proc. of 34th Int. Conf. on Softw. Eng. , ser. ICSE ’12. Piscataway, NJ, USA: IEEE Press, 2012, pp. 299–309. [Online]. Available: http://dl.acm.org/citation.cfm?id=2337223.2337259
2012
Earlier work this paper cites.
H. Hata, O. Mizuno, and T. Kikuno, “Bug prediction based on fine-grained module histories,” in Proc. of 34th Int. Conf. on Softw. Eng. , ser. ICSE ’12. Piscataway, NJ, USA: IEEE Press, 2012, pp. 200–210. [Online]. Available: http://dl.acm.org/citation.cfm?id=2337223.2337247
2012
Earlier work this paper cites.
A. Hindle, E. T. Barr, Z. Su, M. Gabel, and P. Devanbu, “On the naturalness of software,” in Proc. of 34th Int. Conf. on Softw. Eng. , ser. ICSE ’12. Piscataway, NJ, USA: IEEE Press, 2012, pp. 837–847. [Online]. Available: http://dl.acm.org/citation.cfm?id=2337223.2337322
2012
Earlier work this paper cites.
H. D. T. Nguyen, D. Qi, A. Roychoudhury, and S. Chandra, “Semfix: Program repair via semantic analysis,” in Proc. of 35th Int. Conf. on Softw. Eng. , ser. ICSE ’13. Piscataway, NJ, USA: IEEE Press, 2013, pp. 772–781. [Online]. Available: http://dl.acm.org/citation.cfm?id=2486788.2486890
2013
Earlier work this paper cites.
Z. Coker and M. Hafiz, “Program transformations to fix c integers,” in Proc. of 35th Int. Conf. on Softw. Eng. , ser. ICSE ’13. Piscataway, NJ, USA: IEEE Press, 2013, pp. 792–801. [Online]. Available: http://dl.acm.org/citation.cfm?id=2486788.2486892
2013
Earlier work this paper cites.
W. Weimer, Z. P. Fry, and S. Forrest, “Leveraging program equivalence for adaptive program repair: Models and first results,” in Proc. of 28th IEEE/ACM Int. Conf. on Automated Softw. Eng. , ser. ASE’13. Piscataway, NJ, USA: IEEE Press, 2013, pp. 356–366. [Online]. Available: https://doi.org/10.1109/ASE.2013.6693094
2013
Earlier work this paper cites.
D. Kim, J. Nam, J. Song, and S. Kim, “Automatic patch generation learned from human-written patches,” in Proc. of 35th Int. Conf. on Softw. Eng. , ser. ICSE ’13. Piscataway, NJ, USA: IEEE Press, 2013, pp. 802–811. [Online]. Available: http://dl.acm.org/citation.cfm?id=2486788.2486893
2013
Earlier work this paper cites.
A. T. Nguyen, T. T. Nguyen, and T. N. Nguyen, “Lexical statistical machine translation for language migration,” in Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering . ACM, 2013, pp. 651–654
2013
Earlier work this paper cites.
N. Kalchbrenner and P. Blunsom, “Recurrent continuous translation models,” in Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing (EMNLP) , 2013, pp. 1700–1709
2013
Earlier work this paper cites.
P.-S. Huang, X. He, J. Gao, L. Deng, A. Acero, and L. Heck, “Learning deep structured semantic models for web search using clickthrough data,” in Proceedings of the 22nd ACM international conference on Conference on information & knowledge management . ACM, 2013, pp. 2333–2338
2013
Earlier work this paper cites.
C. Dyer, V. Chahuneau, and N. A. Smith, “A simple, fast, and effective reparameterization of ibm model 2,” in Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies , 2013, pp. 644–648
2013
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 Proc. of 28th IEEE/ACM Int. Conf. on Automated Softw. Eng. , ser. ASE’13. Piscataway, NJ, USA: IEEE Press, 2013, pp. 180–190. [Online]. Available: https://doi.org/10.1109/ASE.2013.6693078
2013
Earlier work this paper cites.
M. Allamanis and C. Sutton, “Mining source code repositories at massive scale using language modeling,” in Proc. of 10th Work. Conf. on Mining Softw. Repositories , ser. MSR ’13. Piscataway, NJ, USA: IEEE Press, 2013, pp. 207–216. [Online]. Available: http://dl.acm.org/citation.cfm?id=2487085.2487127
2013
Earlier work this paper cites.
N. Kushman and R. Barzilay, “Using semantic unification to generate regular expressions from natural language,” in Proc. of 2013 Conf. of North American Chapter of Association for Computational Linguistics: Human Language Technologies . Atlanta, Georgia: Association for Computational Linguistics, June 2013, pp. 826–836. [Online]. Available: http://www.aclweb.org/anthology/N13-1103
2013
Earlier work this paper cites.
A. K. Menon, O. Tamuz, S. Gulwani, B. Lampson, and A. T. Kalai, “A machine learning framework for programming by example,” in Proc. of 30th Int. Conf. on Machine Learning - Volume 28 , ser. ICML’13. JMLR.org, 2013, pp. I–187–I–195. [Online]. Available: http://dl.acm.org/citation.cfm?id=3042817.3042840
2013
Earlier work this paper cites.
T. T. Nguyen, A. T. Nguyen, H. A. Nguyen, and T. N. Nguyen, “A statistical semantic language model for source code,” in Proc. of 9th Joint Meeting of the European Softw. Eng. Conf. and the ACM SIGSOFT Symp. on the Found. of Softw. Eng. , ser. ESEC/FSE 2013. New York, NY, USA: ACM, 2013, pp. 532–542. [Online]. Available: http://doi.acm.org/10.1145/2491411.2491458
2013
Earlier work this paper cites.
N. Meng, M. Kim, and K. S. McKinley, “Lase: Locating and applying systematic edits by learning from examples,” in Proc. of 35th Int. Conf. on Softw. Eng. , ser. ICSE ’13. Piscataway, NJ, USA: IEEE Press, 2013, pp. 502–511. [Online]. Available: http://dl.acm.org/citation.cfm?id=2486788.2486855
2013
Earlier work this paper cites.
Y. Pei, C. A. Furia, M. Nordio, Y. Wei, B. Meyer, and A. Zeller, “Automated fixing of programs with contracts,” IEEE Trans. Softw. Eng. , vol. 40, no. 5, pp. 427–449, May 2014. [Online]. Available: https://doi.org/10.1109/TSE.2014.2312918
2014
Earlier work this paper cites.
Y. Qi, X. Mao, Y. Lei, Z. Dai, and C. Wang, “The strength of random search on automated program repair,” in Proc. of 36th Int. Conf. on Softw. Eng. , ser. ICSE 2014. New York, NY, USA: ACM, 2014, pp. 254–265. [Online]. Available: http://doi.acm.org/10.1145/2568225.2568254
2014
Earlier work this paper cites.
S. Kaleeswaran, V. Tulsian, A. Kanade, and A. Orso, “Minthint: Automated synthesis of repair hints,” in Proc. of 36th Int. Conf. on Softw. Eng. , ser. ICSE 2014. New York, NY, USA: ACM, 2014, pp. 266–276. [Online]. Available: http://doi.acm.org/10.1145/2568225.2568258
2014
Earlier work this paper cites.
F. S. Ocariza, Jr., K. Pattabiraman, and A. Mesbah, “Vejovis: Suggesting fixes for javascript faults,” in Proc. of 36th Int. Conf. on Softw. Eng. , ser. ICSE 2014. New York, NY, USA: ACM, 2014, pp. 837–847. [Online]. Available: http://doi.acm.org/10.1145/2568225.2568257
2014
Earlier work this paper cites.
P. Liu, O. Tripp, and C. Zhang, “Grail: Context-aware fixing of concurrency bugs,” in Proc. of 22nd ACM SIGSOFT Int. Symp. on Found. of Softw. Eng. , ser. FSE 2014. New York, NY, USA: ACM, 2014, pp. 318–329. [Online]. Available: http://doi.acm.org/10.1145/2635868.2635881
2014
Earlier work this paper cites.
Y. Lin and S. S. Kulkarni, “Automatic repair for multi-threaded programs with deadlock/livelock using maximum satisfiability,” in Proc. of 23rd Int. Symp. on Softw. Testing and Analysis , ser. ISSTA 2014. New York, NY, USA: ACM, 2014, pp. 237–247. [Online]. Available: http://doi.acm.org/10.1145/2610384.2610398
2014
Earlier work this paper cites.
E. T. Barr, Y. Brun, P. Devanbu, M. Harman, and F. Sarro, “The plastic surgery hypothesis,” in Proc. of 22nd ACM SIGSOFT Int. Symp. on Found. of Softw. Eng. , ser. FSE 2014. New York, NY, USA: ACM, 2014, pp. 306–317. [Online]. Available: http://doi.acm.org/10.1145/2635868.2635898
2014
Earlier work this paper cites.
I. Sutskever, O. Vinyals, and Q. V. Le, “Sequence to sequence learning with neural networks,” in Proceedings of the 28th Annual Conference on Neural Information Processing Systems (NIPS) , 2014, pp. 3104–3112
2014
Earlier work this paper cites.
D. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv preprint arXiv:1412.6980 , 2014
Original
2014
Earlier work this paper cites.
N. Srivastava, G. E. Hinton, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov, “Dropout: a simple way to prevent neural networks from overfitting.” Journal of machine learning research , vol. 15, no. 1, pp. 1929–1958, 2014
2014
Earlier work this paper cites.
K. Fujiwara, H. Hata, E. Makihara, Y. Fujihara, N. Nakayama, H. Iida, and K. Matsumoto, “Kataribe: A hosting service of historage repositories,” in Proc. of 11th Work. Conf. on Mining Softw. Repositories , ser. MSR ’14. New York, NY, USA: ACM, 2014, pp. 380–383. [Online]. Available: http://doi.acm.org/10.1145/2597073.2597125
2014
Earlier work this paper cites.
J. Siegmund, C. Kästner, J. Liebig, S. Apel, and S. Hanenberg, “Measuring and modeling programming experience,” Empirical Softw. Engg. , vol. 19, no. 5, pp. 1299–1334, Oct. 2014. [Online]. Available: http://dx.doi.org/10.1007/s10664-013-9286-4
2014
Earlier work this paper cites.

Similar

R. Just, D. Jalali, and M. D. Ernst, “Defects4j: A database of existing faults to enable controlled testing studies for java programs,” in Proc. of 23rd Int. Symp. on Softw. Testing and Analysis , ser. ISSTA 2014. New York, NY, USA: ACM, 2014, pp. 437–440. [Online]. Available: http://doi.acm.org/10.1145/2610384.2628055
2014
Cited alongside, same era.
M. Allamanis, E. T. Barr, C. Bird, and C. Sutton, “Learning natural coding conventions,” in Proc. of 22nd ACM SIGSOFT Int. Symp. on Found. of Softw. Eng. , ser. FSE 2014. New York, NY, USA: ACM, 2014, pp. 281–293. [Online]. Available: http://doi.acm.org/10.1145/2635868.2635883
2014
Cited alongside, same era.
M. Allamanis and C. Sutton, “Mining idioms from source code,” in Proc. of 22nd ACM SIGSOFT Int. Symp. on Found. of Softw. Eng. , ser. FSE 2014. New York, NY, USA: ACM, 2014, pp. 472–483. [Online]. Available: http://doi.acm.org/10.1145/2635868.2635901
2014
Cited alongside, same era.
J. C. Campbell, A. Hindle, and J. N. Amaral, “Syntax errors just aren’t natural: Improving error reporting with language models,” in Proc. of 11th Work. Conf. on Mining Softw. Repositories , ser. MSR 2014. New York, NY, USA: ACM, 2014, pp. 252–261. [Online]. Available: http://doi.acm.org/10.1145/2597073.2597102
2014
Cited alongside, same era.
L. Cerulo, M. Di Penta, A. Bacchelli, M. Ceccarelli, and G. Canfora, “Irish: A hidden markov model to detect coded information islands in free text,” Sci. Comput. Program. , vol. 105, no. C, pp. 26–43, Jul. 2015. [Online]. Available: http://dx.doi.org/10.1016/j.scico.2014.11.017
2014
Cited alongside, same era.
S. Gulwani and M. Marron, “Nlyze: Interactive programming by natural language for spreadsheet data analysis and manipulation,” in Proc. of 2014 ACM SIGMOD Int. Conf. on Management of Data , ser. SIGMOD ’14. New York, NY, USA: ACM, 2014, pp. 803–814. [Online]. Available: http://doi.acm.org/10.1145/2588555.2612177
2014
Cited alongside, same era.
C.-H. Hsiao, M. Cafarella, and S. Narayanasamy, “Using web corpus statistics for program analysis,” in Procl of 2014 ACM Int. Conf. on Object Oriented Programming Syst. Languages and Appl. , ser. OOPSLA ’14. New York, NY, USA: ACM, 2014, pp. 49–65. [Online]. Available: http://doi.acm.org/10.1145/2660193.2660226
2014
Cited alongside, same era.
S. Karaivanov, V. Raychev, and M. Vechev, “Phrase-based statistical translation of programming languages,” in Proc. of 2014 ACM Int. Symp. on New Ideas, New Paradigms, and Reflections on Programming and Software , ser. Onward! 2014. New York, NY, USA: ACM, 2014, pp. 173–184. [Online]. Available: http://doi.acm.org/10.1145/2661136.2661148
2014
Cited alongside, same era.
C. J. Maddison and D. Tarlow, “Structured generative models of natural source code,” in Proc. of 31st Int. Conf. on Machine Learning - Volume 32 , ser. ICML’14. JMLR.org, 2014, pp. II–649–II–657. [Online]. Available: http://dl.acm.org/citation.cfm?id=3044805.3044965
2014
Cited alongside, same era.
V. Raychev, M. Vechev, and E. Yahav, “Code completion with statistical language models,” in Proc. of 35th ACM SIGPLAN Conf. on Programming Language Design and Implementation , ser. PLDI ’14. New York, NY, USA: ACM, 2014, pp. 419–428. [Online]. Available: http://doi.acm.org/10.1145/2594291.2594321
2014
Cited alongside, same era.
Z. Tu, Z. Su, and P. Devanbu, “On the localness of software,” in Proc. of 22nd ACM SIGSOFT Int. Symp. on Found. of Softw. Eng. , ser. FSE 2014. New York, NY, USA: ACM, 2014, pp. 269–280. [Online]. Available: http://doi.acm.org/10.1145/2635868.2635875
2014
Cited alongside, same era.
S. Mechtaev, J. Yi, and A. Roychoudhury, “Directfix: Looking for simple program repairs,” in Proc. of 37th Int. Conf. on Softw. Eng. - Vol. 1 , ser. ICSE ’15. Piscataway, NJ, USA: IEEE Press, 2015, pp. 448–458. [Online]. Available: http://dl.acm.org/citation.cfm?id=2818754.2818811
2015
Cited alongside, same era.

Then

W. He, Z. He, H. Wu, and H. Wang, “Improved neural machine translation with smt features,” in Proc. of the 30th AAAI Conf. on Artificial Intelligence , ser. AAAI’16. AAAI Press, 2016, pp. 151–157. [Online]. Available: http://dl.acm.org/citation.cfm?id=3015812.3015835
2016
Later among the works it cites.
P. Arthur, G. Neubig, and S. Nakamura, “Incorporating discrete translation lexicons into neural machine translation.” in Proc. of Conference on Empirical Methods in Natural Language Processing , ser. EMNLP’16, 2016, pp. 1557–1567
2016
Later among the works it cites.
L. Liu, M. Utiyama, A. M. Finch, and E. Sumita, “Neural machine translation with supervised attention,” CoRR , vol. abs/1609.04186, 2016. [Online]. Available: http://arxiv.org/abs/1609.04186
Original
2016
Later among the works it cites.
Y. Wu, M. Schuster, Z. Chen, Q. V. Le, M. Norouzi, W. Macherey, M. Krikun, Y. Cao, Q. Gao, K. Macherey, J. Klingner, A. Shah, M. Johnson, X. Liu, L. Kaiser, S. Gouws, Y. Kato, T. Kudo, H. Kazawa, K. Stevens, G. Kurian, N. Patil, W. Wang, C. Young, J. Smith, J. Riesa, A. Rudnick, O. Vinyals, G. Corrado, M. Hughes, and J. Dean, “Google’s neural machine translation system: Bridging the gap between human and machine translation,” CoRR , vol. abs/1609.08144, 2016. [Online]. Available: http://arxiv.org/abs/1609.08144
Original
2016
Later among the works it cites.
B. Ray, V. Hellendoorn, S. Godhane, Z. Tu, A. Bacchelli, and P. Devanbu, “On the ”naturalness” of buggy code,” in Proc. of 38th Int. Conf. on Softw. Eng. , ser. ICSE ’16. New York, NY, USA: ACM, 2016, pp. 428–439. [Online]. Available: http://doi.acm.org/10.1145/2884781.2884848
2016
Later among the works it cites.
P. Bielik, V. Raychev, and M. Vechev, “Phog: Probabilistic model for code,” in Proc. of 33rd Int. Conf. on Machine Learning - Volume 48 , ser. ICML’16. JMLR.org, 2016, pp. 2933–2942. [Online]. Available: http://dl.acm.org/citation.cfm?id=3045390.3045699
2016
Later among the works it cites.
T. T. Nguyen, H. V. Pham, P. M. Vu, and T. T. Nguyen, “Learning api usages from bytecode: A statistical approach,” in Proc. of 38th Int. Conf. on Softw. Eng. , ser. ICSE ’16. New York, NY, USA: ACM, 2016, pp. 416–427. [Online]. Available: http://doi.acm.org/10.1145/2884781.2884873
2016
Later among the works it cites.
V. Raychev, P. Bielik, M. Vechev, and A. Krause, “Learning programs from noisy data,” in Proc. of 43rd Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages , ser. POPL ’16. New York, NY, USA: ACM, 2016, pp. 761–774. [Online]. Available: http://doi.acm.org/10.1145/2837614.2837671
2016
Later among the works it cites.
S. Yadid and E. Yahav, “Extracting code from programming tutorial videos,” in Proc. of 2016 ACM Int. Symp. on New Ideas, New Paradigms, and Reflections on Programming and Software , ser. Onward! 2016. New York, NY, USA: ACM, 2016, pp. 98–111. [Online]. Available: http://doi.acm.org/10.1145/2986012.2986021
2016
Later among the works it cites.
Y. Xiong, J. Wang, R. Yan, J. Zhang, S. Han, G. Huang, and L. Zhang, “Precise condition synthesis for program repair,” in Proc. of 39th Int. Conf. on Softw. Eng. , ser. ICSE ’17. Piscataway, NJ, USA: IEEE Press, 2017, pp. 416–426. [Online]. Available: https://doi.org/10.1109/ICSE.2017.45
2017
Later among the works it cites.
X.-B. D. Le, D.-H. Chu, D. Lo, C. Le Goues, and W. Visser, “S3: Syntax- and semantic-guided repair synthesis via programming by examples,” in Proc. of 11th Joint Meeting on Found. of Softw. Eng. , ser. ESEC/FSE 2017. New York, NY, USA: ACM, 2017, pp. 593–604. [Online]. Available: http://doi.acm.org/10.1145/3106237.3106309
2017
Later among the works it cites.
R. K. Saha, Y. Lyu, H. Yoshida, and M. R. Prasad, “Elixir: Effective object oriented program repair,” in Proc. of 32nd IEEE/ACM Int. Conf. on Automated Softw. Eng. , ser. ASE 2017. Piscataway, NJ, USA: IEEE Press, 2017, pp. 648–659. [Online]. Available: http://dl.acm.org/citation.cfm?id=3155562.3155643
2017
Later among the works it cites.
E. C. Campos and M. A. Maia, “Common bug-fix patterns: A large-scale observational study,” in Proc. of 11th ACM/IEEE Int. Symp. on Empirical Softw. Eng. and Measurement , ser. ESEM ’17. Piscataway, NJ, USA: IEEE Press, 2017, pp. 404–413. [Online]. Available: https://doi.org/10.1109/ESEM.2017.55
2017
Later among the works it cites.
F. Long, P. Amidon, and M. Rinard, “Automatic inference of code transforms for patch generation,” in Proc. of 11th Joint Meeting on Found. of Softw. Eng. , ser. ESEC/FSE 2017. New York, NY, USA: ACM, 2017, pp. 727–739. [Online]. Available: http://doi.acm.org/10.1145/3106237.3106253
2017
Later among the works it cites.
Q. Xin and S. P. Reiss, “Leveraging syntax-related code for automated program repair,” in Proc. of 32nd IEEE/ACM Int. Conf. on Automated Softw. Eng. , ser. ASE 2017. Piscataway, NJ, USA: IEEE Press, 2017, pp. 660–670. [Online]. Available: http://dl.acm.org/citation.cfm?id=3155562.3155644
2017
Later among the works it cites.
P. Yin and G. Neubig, “A syntactic neural model for general-purpose code generation,” in Proc. of 55th Annual Meeting of Association for Computational Linguistics (Volume 1: Long Papers) . Vancouver, Canada: Association for Computational Linguistics, July 2017, pp. 440–450. [Online]. Available: http://aclweb.org/anthology/P17-1041
2017
Later among the works it cites.
M. Rabinovich, M. Stern, and D. Klein, “Abstract syntax networks for code generation and semantic parsing,” in Proc. of 55th Annual Meeting of Association for Computational Linguistics (Volume 1: Long Papers) . Vancouver, Canada: Association for Computational Linguistics, July 2017, pp. 1139–1149. [Online]. Available: http://aclweb.org/anthology/P17-1105
2017
Later among the works it cites.
R. Gupta, S. Pal, A. Kanade, and S. Shevade, “Deepfix: Fixing common c language errors by deep learning,” in AAAI Conference on Artificial Intelligence , 2017. [Online]. Available: https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14603
2017
Later among the works it cites.
R. Rolim, G. Soares, L. D’Antoni, O. Polozov, S. Gulwani, R. Gheyi, R. Suzuki, and B. Hartmann, “Learning syntactic program transformations from examples,” in Proc. of 39th Int. Conf. on Softw. Eng. , ser. ICSE ’17. Piscataway, NJ, USA: IEEE Press, 2017, pp. 404–415. [Online]. Available: https://doi.org/10.1109/ICSE.2017.44
2017
Later among the works it cites.
G. Neubig, “Neural machine translation and sequence-to-sequence models: A tutorial,” arXiv preprint arXiv:1703.01619 , 2017
Original
2017
Later among the works it cites.
G. Neubig, C. Dyer, Y. Goldberg, A. Matthews, W. Ammar, A. Anastasopoulos, M. Ballesteros, D. Chiang, D. Clothiaux, T. Cohn, K. Duh, M. Faruqui, C. Gan, D. Garrette, Y. Ji, L. Kong, A. Kuncoro, G. Kumar, C. Malaviya, P. Michel, Y. Oda, M. Richardson, N. Saphra, S. Swayamdipta, and P. Yin, “Dynet: The dynamic neural network toolkit,” arXiv preprint arXiv:1701.03980 , 2017
Original
2017
Later among the works it cites.
X. Wang, Z. Lu, Z. Tu, H. Li, D. Xiong, and M. Zhang, “Neural machine translation advised by statistical machine translation,” in AAAI Conference on Artificial Intelligence , 2017. [Online]. Available: https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14451
2017
Later among the works it cites.
Z. Tu, Y. Liu, L. Shang, X. Liu, and H. Li, “Neural machine translation with reconstruction,” in AAAI Conference on Artificial Intelligence , 2017. [Online]. Available: https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14161
2017
Later among the works it cites.
D. A. da Costa, S. McIntosh, W. Shang, U. Kulesza, R. Coelho, and A. E. Hassan, “A framework for evaluating the results of the szz approach for identifying bug-introducing changes,” IEEE Trans. Softw. Eng. , vol. 43, no. 7, pp. 641–657, July 2017
2017
Later among the works it cites.
M. Allamanis, E. T. Barr, P. Devanbu, and C. Sutton, “A Survey of Machine Learning for Big Code and Naturalness,” ArXiv e-prints , Sep. 2017
2017
Later among the works it cites.
C. Cummins, P. Petoumenos, Z. Wang, and H. Leather, “Synthesizing benchmarks for predictive modeling,” in Proc. of 2017 Int. Symp. on Code Generation and Optimization , ser. CGO ’17. Piscataway, NJ, USA: IEEE Press, 2017, pp. 86–99. [Online]. Available: http://dl.acm.org/citation.cfm?id=3049832.3049843
2017
Later among the works it cites.
V. J. Hellendoorn and P. Devanbu, “Are deep neural networks the best choice for modeling source code?” in Proc. of 11th Joint Meeting on Found. of Softw. Eng. , ser. ESEC/FSE 2017. New York, NY, USA: ACM, 2017, pp. 763–773. [Online]. Available: http://doi.acm.org/10.1145/3106237.3106290
2017
Later among the works it cites.
B. Vasilescu, C. Casalnuovo, and P. Devanbu, “Recovering clear, natural identifiers from obfuscated js names,” in Proc. of 11th Joint Meeting on Found. of Softw. Eng. , ser. ESEC/FSE 2017. New York, NY, USA: ACM, 2017, pp. 683–693. [Online]. Available: http://doi.acm.org/10.1145/3106237.3106289
2017
Later among the works it cites.
R. Yue, N. Meng, and Q. Wang, “A characterization study of repeated bug fixes,” in Proc. of 33rd IEEE Int. Conf. on Softw. Maintenance and Evolution , Sept 2017, pp. 422–432
2017
Later among the works it cites.
J. Hua, M. Zhang, K. Wang, and S. Khurshid, “Towards practical program repair with on-demand candidate generation,” in Proc. of 40th Int. Conf. on Softw. Eng. , ser. ICSE ’18. New York, NY, USA: ACM, 2018, pp. 12–23. [Online]. Available: http://doi.acm.org/10.1145/3180155.3180245
2018
Closest in time.
S. Mechtaev, M.-D. Nguyen, Y. Noller, L. Grunske, and A. Roychoudhury, “Semantic program repair using a reference implementation,” in Proc. of 40th Int. Conf. on Softw. Eng. , ser. ICSE ’18. New York, NY, USA: ACM, 2018, pp. 129–139. [Online]. Available: http://doi.acm.org/10.1145/3180155.3180247
2018
Closest in time.
M. Monperrus, “Automatic software repair: A bibliography,” ACM Comput. Surv. , vol. 51, no. 1, pp. 17:1–17:24, Jan. 2018. [Online]. Available: http://doi.acm.org/10.1145/3105906
2018
Closest in time.
L. Gazzola, D. Micucci, and L. Mariani, “Automatic software repair: A survey,” IEEE Trans. Softw. Eng. , pp. 1–1, 2018
2018
Closest in time.
Y. Jia, K. Mao, and M. Harman. (2018) Finding and fixing software bugs automatically with sapfix and sapienz. [Online]. Available: https://code.fb.com/developer-tools/finding-and-fixing-software-bugs-automatically-with-sapfix-and-sapienz/
2018
Closest in time.
M. Wen, J. Chen, R. Wu, D. Hao, and S.-C. Cheung, “Context-aware patch generation for better automated program repair,” in Proc. of 40th Int. Conf. on Softw. Eng. , ser. ICSE ’18. New York, NY, USA: ACM, 2018, pp. 1–11. [Online]. Available: http://doi.acm.org/10.1145/3180155.3180233
2018
Closest in time.
J. Jiang, Y. Xiong, H. Zhang, Q. Gao, and X. Chen, “Shaping program repair space with existing patches and similar code,” in Proc. of 27th ACM SIGSOFT Int. Symp. on Softw. Testing and Analysis , ser. ISSTA 2018. New York, NY, USA: ACM, 2018, pp. 298–309. [Online]. Available: http://doi.acm.org/10.1145/3213846.3213871
2018
Closest in time.
R. van Tonder and C. L. Goues, “Static automated program repair for heap properties,” in Proc. of 40th Int. Conf. on Softw. Eng. , ser. ICSE ’18. New York, NY, USA: ACM, 2018, pp. 151–162. [Online]. Available: http://doi.acm.org/10.1145/3180155.3180250
2018
Closest in time.
K. Liu, D. Kim, T. F. Bissyande, S. Yoo, and Y. Le Traon, “Mining fix patterns for findbugs violations,” IEEE Transactions on Software Engineering , pp. 1–1, 2018
2018
Closest in time.
M. Motwani, S. Sankaranarayanan, R. Just, and Y. Brun, “Do automated program repair techniques repair hard and important bugs?” Empirical Softw. Eng. , vol. 23, no. 5, pp. 2901–2947, Oct 2018. [Online]. Available: https://doi.org/10.1007/s10664-017-9550-0
2018
Closest in time.
S. Chakraborty, M. Allamanis, and B. Ray, “Tree2tree neural translation model for learning source code changes,” CoRR , vol. abs/1810.00314, 2018. [Online]. Available: http://arxiv.org/abs/1810.00314
Original
2018
Closest in time.
M. Tufano, C. Watson, G. Bavota, M. Di Penta, M. White, and D. Poshyvanyk, “An empirical investigation into learning bug-fixing patches in the wild via neural machine translation,” in Proc. of 33rd IEEE/ACM Int. Conf. on Automated Softw. Eng. , ser. ASE 2018. New York, NY, USA: ACM, 2018, pp. 832–837. [Online]. Available: http://doi.acm.org/10.1145/3238147.3240732
2018
Closest in time.
M. Tufano, C. Watson, G. Bavota, M. Di Penta, M. White, and D. Poshyvanyk, “An Empirical Study on Learning Bug-Fixing Patches in the Wild via Neural Machine Translation,” arXiv e-prints , p. arXiv:1812.08693, Dec 2018
Original
2018
Closest in time.
Y. Sulistyo Nugroho, H. Hata, and K. Matsumoto, “How Different Are Different diff Algorithms in Git? Use –histogram for Code Changes,” arXiv e-prints , p. arXiv:1902.02467, Feb 2019
Original
2019
Closest in time.
M. Tufano, J. Pantiuchina, C. Watson, G. Bavota, and D. Poshyvanyk, “On learning meaningful code changes via neural machine translation,” in Proc. of 41st Int. Conf. on Softw. Eng. , ser. ICSE ’19. Piscataway, NJ, USA: IEEE Press, 2019, pp. 25–36. [Online]. Available: https://doi.org/10.1109/ICSE.2019.00021
2019
Closest in time.
S. Saha, R. K. Saha, and M. R. Prasad, “Harnessing evolution for multi-hunk program repair,” in Proc. of 41st Int. Conf. on Softw. Eng. , ser. ICSE ’19. Piscataway, NJ, USA: IEEE Press, 2019, pp. 13–24. [Online]. Available: https://doi.org/10.1109/ICSE.2019.00020
2019
Closest in time.
S. Iyer, I. Konstas, A. Cheung, and L. Zettlemoyer, “Summarizing source code using a neural attention model,” in Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (ACL) , 2016, pp. 2073–2083
2083
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…