Fetching the paper…
Reading the bibliography…
Students often make mistakes on their introductory programming assignments as part of their learning process.
R. W. Hamming, “Error detecting and error correcting codes,” The Bell System Technical Journal , vol. 29, no. 2, pp. 147–160, 1950
1950
Earlier work this paper cites.
N. Singer, “The hard part of computer science? getting into class,” The New York Times , Jan. 2019, accessed: 2012-09-01
2012
Earlier work this paper cites.
C. Le Goues, T. Nguyen, S. Forrest, and W. Weimer, “Genprog: A generic method for automatic software repair,” IEEE Transactions on Software Engineering , vol. 38, no. 1, pp. 54–72, 2012
2012
Earlier work this paper cites.
R. Singh, S. Gulwani, and A. Solar-Lezama, “Automated feedback generation for introductory programming assignments,” in Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation , ser. PLDI 13. New York, NY, USA: Association for Computing Machinery, 2013, p. 15–26
2013
Earlier work this paper cites.
D. Kim, J. Nam, J. Song, and S. Kim, “Automatic patch generation learned from human-written patches,” in Proceedings of the 2013 International Conference on Software Engineering , ser. ICSE ’13. IEEE Press, 2013, p. 802–811
2013
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 Proceedings of the 36th International Conference on Software Engineering , ser. ICSE 2014, New York, NY, USA, 2014, p. 254–265
2014
Earlier work this paper cites.
Y. Ke, K. T. Stolee, C. Le Goues, and Y. Brun, “Repairing programs with semantic code search (t),” in 2015 30th IEEE/ACM International Conference on Automated Software Engineering (ASE) . IEEE, 2015, pp. 295–306
2015
Earlier work this paper cites.
A. Altadmri and N. C. Brown, “37 million compilations: Investigating novice programming mistakes in large-scale student data,” in Proceedings of the 46th ACM Technical Symposium on Computer Science Education , ser. SIGCSE ’15. New York, NY, USA: Association for Computing Machinery, 2015, p. 522–527
2015
Earlier work this paper cites.
F. Long and M. Rinard, “Automatic patch generation by learning correct code,” in Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages , ser. POPL ’16. New York, NY, USA: Association for Computing Machinery, 2016, p. 298–312
2016
Earlier work this paper cites.
S. Mechtaev, J. Yi, and A. Roychoudhury, “Angelix: Scalable multiline program patch synthesis via symbolic analysis,” in 2016 IEEE/ACM 38th International Conference on Software Engineering (ICSE) , 2016, pp. 691–701
2016
Earlier work this paper cites.
Y. Pu, K. Narasimhan, A. Solar-Lezama, and R. Barzilay, “Sk_p: A neural program corrector for moocs,” in Companion Proceedings of the 2016 ACM SIGPLAN International Conference on Systems, Programming, Languages and Applications: Software for Humanity , ser. SPLASH Companion 2016. New York, NY, USA: Association for Computing Machinery, 2016, p. 39–40
2016
Earlier work this paper cites.
F. Long, P. Amidon, and M. Rinard, “Automatic inference of code transforms for patch generation,” in Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering , ser. ESEC/FSE 2017. New York, NY, USA: Association for Computing Machinery, 2017, p. 727–739
2017
Earlier work this paper 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 ICSE 2017 , April 2017
2017
Earlier work this paper cites.
I. Drosos, P. J. Guo, and C. Parnin, “Happyface: Identifying and predicting frustrating obstacles for learning programming at scale,” in 2017 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC) , 2017, pp. 171–179
2017
Earlier work this paper cites.
J. Yi, U. Z. Ahmed, A. Karkare, S. H. Tan, and A. Roychoudhury, “A feasibility study of using automated program repair for introductory programming assignments,” in Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering , ser. ESEC/FSE 2017. New York, NY, USA: Association for Computing Machinery, 2017, p. 740–751
2017
Earlier work this paper cites.
Q. Xin and S. P. Reiss, “Leveraging syntax-related code for automated program repair,” in Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering , ser. ASE 2017. IEEE Press, 2017, p. 660–670
2017
Earlier work this paper cites.
S. Gulwani, I. Radicek, and F. Zuleger, “Automated clustering and program repair for introductory programming assignments,” SIGPLAN Not. , vol. 53, no. 4, p. 465–480, Jun. 2018
2018
Earlier work this paper cites.
K. Wang, R. Singh, and Z. Su, “Search, align, and repair: Data-driven feedback generation for introductory programming exercises,” ser. PLDI 2018. New York, NY, USA: Association for Computing Machinery, 2018, p. 481–495
2018
Cited alongside, same era.
U. Z. Ahmed, P. Kumar, A. Karkare, P. Kar, and S. Gulwani, “Compilation error repair: for the student programs, from the student programs,” in Proceedings of the 40th International Conference on Software Engineering: Software Engineering Education and Training , 2018, pp. 78–87
2018
Cited alongside, same era.
S. Mechtaev, M. Nguyen, Y. Noller, L. Grunske, and A. Roychoudhury, “Semantic program repair using a reference implementation,” in Proceedings of the 40th International Conference on Software Engineering, ICSE 2018, Gothenburg, Sweden, May 27 - June 03, 2018 , M. Chaudron, I. Crnkovic, M. Chechik, and M. Harman, Eds. ACM, 2018, pp. 129–139
2018
Cited alongside, same era.
K. Wang, Z. Su, and R. Singh, “Dynamic neural program embeddings for program repair,” in International Conference on Learning Representations , 2018
G. Verbruggen, V. Le, and S. Gulwani, “Semantic programming by example with pre-trained models,” Proc. ACM Program. Lang. , vol. 5, no. OOPSLA, pp. 1–25, 2021
2021
Later among the works it cites.
K. Rahmani, M. Raza, S. Gulwani, V. Le, D. Morris, A. Radhakrishna, G. Soares, and A. Tiwari, “Multi-modal program inference: a marriage of pre-trained language models and component-based synthesis,” Proc. ACM Program. Lang. , vol. 5, no. OOPSLA, pp. 1–29, 2021
2021
Later among the works it cites.
U. Z. Ahmed, Z. Fan, J. Yi, O. I. Al-Bataineh, and A. Roychoudhury, “Verifix: Verified repair of programming assignments,” ACM Trans. Softw. Eng. Methodol. , vol. 31, no. 4, jul 2022
2022
Closest in time.
“Microsoft Copilot.” https://github.com/features/copilot/ , Aug. 2022
2022
Closest in time.
E. Berger, “Coping with copilot,” https://www.sigarch.org/coping-with-copilot/ , 2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
C. Le Goues, M. Pradel, and A. Roychoudhury, “Automated program repair,” Commun. ACM , vol. 62, no. 12, p. 56–65, 2019
2019
Cited alongside, same era.
Y. Hu, U. Z. Ahmed, S. Mechtaev, B. Leong, and A. Roychoudhury, “Re-factoring based program repair applied to programming assignments,” in 2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE) , 2019, pp. 388–398
2019
Cited alongside, same era.
T. B. Brown et al. , “Language models are few-shot learners,” in NeurIPS 2020, December 6-12, 2020, virtual , 2020
2020
Cited alongside, same era.
D. Chhatbar, U. Z. Ahmed, and P. Kar, “Macer: A modular framework for accelerated compilation error repair,” in Artificial Intelligence in Education: 21st International Conference, AIED 2020, Ifrane, Morocco, July 6–10, 2020, Proceedings, Part I . Berlin, Heidelberg: Springer-Verlag, 2020, p. 106–117
2020
Cited alongside, same era.
E. Dinella, H. Dai, Z. Li, M. Naik, L. Song, and K. Wang, “Hoppity: Learning graph transformations to detect and fix bugs in programs,” in 8th International Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26-30, 2020 . OpenReview.net, 2020
2020
Cited alongside, same era.
2021
Cited alongside, same era.
M. Yasunaga and P. Liang, “Break-it-fix-it: Unsupervised learning for program repair,” in ICML , ser. Proceedings of Machine Learning Research, vol. 139. PMLR, 2021, pp. 11 941–11 952
2021
Cited alongside, same era.
M. Chen et al. , “Evaluating large language models trained on code,” 2021
2021
Cited alongside, same era.
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
“New GPT-3 Capabilities: Edit & Insert,” Mar. 2022. [Online]. Available: https://openai.com/blog/gpt-3-edit-insert/
2022
Closest in time.
2022
Closest in time.
L. Li, H. Liu, K. Li, Y. Jiang, and R. Sun, “Generating concise patches for newly released programming assignments,” IEEE Transactions on Software Engineering , pp. 1–1, 2022
2022
Closest in time.
Y. Li et al. , “Competition-level code generation with alphacode,” Feb 2022
2022
Closest in time.
J. Finnie-Ansley, P. Denny, B. A. Becker, A. Luxton-Reilly, and J. Prather, “The robots are coming: Exploring the implications of openai codex on introductory programming,” in Australasian Computing Education Conference , ser. ACE ’22. New York, NY, USA: Association for Computing Machinery, 2022, p. 10–19
2022
Closest in time.
2022
Closest in time.
E. Dinella, G. Ryan, T. Mytkowicz, and S. K. Lahiri, “TOGA: A neural method for test oracle generation,” in 44th IEEE/ACM 44th International Conference on Software Engineering, ICSE 2022, Pittsburgh, PA, USA, May 25-27, 2022 . ACM, 2022, pp. 2130–2141
2022
Closest in time.
J. Zhang, T. Mytkowicz, M. Kaufman, R. Piskac, and S. K. Lahiri, “Using pre-trained language models to resolve textual and semantic merge conflicts (experience paper),” in ISSTA . ACM, 2022, pp. 77–88
2022
Closest in time.