RLCoder: Reinforcement Learning for Repository-Level Code Completion

V. I. Levenshtein et al. , “Binary codes capable of correcting deletions, insertions, and reversals,” in Soviet physics doklady , vol. 10, no. 8. Soviet Union, 1966, pp. 707–710

1966

Earlier work this paper cites.

R. Robbes and M. Lanza, “How program history can improve code completion,” in 2008 23rd IEEE/ACM International Conference on Automated Software Engineering . IEEE, 2008, pp. 317–326

2008

Earlier work this paper cites.

S. Robertson, H. Zaragoza et al. , “The probabilistic relevance framework: Bm25 and beyond,” Foundations and Trends® in Information Retrieval , vol. 3, no. 4, pp. 333–389, 2009

2009

Earlier work this paper cites.

M. Bruch, M. Monperrus, and M. Mezini, “Learning from examples to improve code completion systems,” in Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on the foundations of software engineering , 2009, pp. 213–222

2009

Earlier work this paper cites.

D. Hou and D. M. Pletcher, “Towards a better code completion system by api grouping, filtering, and popularity-based ranking,” in Proceedings of the 2nd International Workshop on Recommendation Systems for Software Engineering , 2010, pp. 26–30

2010

Earlier work this paper cites.

V. J. Hellendoorn and P. Devanbu, “Are deep neural networks the best choice for modeling source code?” in Proceedings of the 2017 11th Joint meeting on foundations of software engineering , 2017, pp. 763–773

2017

Earlier work this paper cites.

J. Li, Y. Wang, M. R. Lyu, and I. King, “Code completion with neural attention and pointer networks,” arXiv preprint arXiv:1711.09573 , 2017

Original

2017

Earlier work this paper cites.

Y. Yang, Y. Jiang, M. Gu, J. Sun, J. Gao, and H. Liu, “A language model for statements of software code,” in 2017 32nd IEEE/ACM International Conference on Automated Software Engineering (ASE) . IEEE, 2017, pp. 682–687

2017

Earlier work this paper cites.

S. A. Hayati, R. Olivier, P. Avvaru, P. Yin, A. Tomasic, and G. Neubig, “Retrieval-based neural code generation,” arXiv preprint arXiv:1808.10025 , 2018

Original

2018

Earlier work this paper cites.

V. J. Hellendoorn, S. Proksch, H. C. Gall, and A. Bacchelli, “When code completion fails: A case study on real-world completions,” in 2019 IEEE/ACM 41st International Conference on Software Engineering (ICSE) . IEEE, 2019, pp. 960–970

2019

Earlier work this paper cites.

C. Wang, X. Peng, M. Liu, Z. Xing, X. Bai, B. Xie, and T. Wang, “A learning-based approach for automatic construction of domain glossary from source code and documentation,” in Proceedings of the 2019 27th ACM joint meeting on european software engineering conference and symposium on the foundations of software engineering , 2019, pp. 97–108

2019

Earlier work this paper cites.

M. Liu, X. Peng, A. Marcus, Z. Xing, W. Xie, S. Xing, and Y. Liu, “Generating query-specific class api summaries,” in Proceedings of the 2019 27th ACM joint meeting on European software engineering conference and symposium on the foundations of software engineering , 2019, pp. 120–130

2019

Earlier work this paper cites.

S. Nguyen, T. Nguyen, Y. Li, and S. Wang, “Combining program analysis and statistical language model for code statement completion,” in 2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE) . IEEE, 2019, pp. 710–721

2019

Earlier work this paper cites.

J. Zhang, X. Wang, H. Zhang, H. Sun, and X. Liu, “Retrieval-based neural source code summarization,” in Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering , 2020, pp. 1385–1397

2020

Earlier work this paper cites.

G. A. Aye and G. E. Kaiser, “Sequence model design for code completion in the modern ide,” arXiv preprint arXiv:2004.05249 , 2020

Original

2020

Earlier work this paper cites.

R.-M. Karampatsis, H. Babii, R. Robbes, C. Sutton, and A. Janes, “Big code!= big vocabulary: Open-vocabulary models for source code,” in Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering , 2020, pp. 1073–1085

2020

Earlier work this paper cites.

A. Svyatkovskiy, S. K. Deng, S. Fu, and N. Sundaresan, “Intellicode compose: Code generation using transformer,” in Proceedings of the 28th ACM joint meeting on European software engineering conference and symposium on the foundations of software engineering , 2020, pp. 1433–1443

2020

Earlier work this paper cites.

M. Chen, J. Tworek, H. Jun, Q. Yuan, H. P. d. O. Pinto, J. Kaplan, H. Edwards, Y. Burda, N. Joseph, G. Brockman et al. , “Evaluating large language models trained on code,” arXiv preprint arXiv:2107.03374 , 2021

Original

2021

Earlier work this paper cites.

J. A. Li, Y. Li, G. Li, X. Hu, X. Xia, and Z. Jin, “Editsum: A retrieve-and-edit framework for source code summarization,” in 2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE) . IEEE, 2021, pp. 155–166

2021

Earlier work this paper cites.

M. R. Parvez, W. U. Ahmad, S. Chakraborty, B. Ray, and K.-W. Chang, “Retrieval augmented code generation and summarization,” arXiv preprint arXiv:2108.11601 , 2021

Original

2021

Earlier work this paper cites.

J. Austin, A. Odena, M. Nye, M. Bosma, H. Michalewski, D. Dohan, E. Jiang, C. Cai, M. Terry, Q. Le et al. , “Program synthesis with large language models,” arXiv preprint arXiv:2108.07732 , 2021

Original

2021

Earlier work this paper cites.

C. Liu, X. Xia, D. Lo, C. Gao, X. Yang, and J. Grundy, “Opportunities and challenges in code search tools,” ACM Computing Surveys (CSUR) , vol. 54, no. 9, pp. 1–40, 2021

2021

Earlier work this paper cites.

Y. Wang and H. Li, “Code completion by modeling flattened abstract syntax trees as graphs,” in Proceedings of the AAAI conference on artificial intelligence , vol. 35, no. 16, 2021, pp. 14 015–14 023

2021

Earlier work this paper cites.

S. Kim, J. Zhao, Y. Tian, and S. Chandra, “Code prediction by feeding trees to transformers,” in 2021 IEEE/ACM 43rd International Conference on Software Engineering (ICSE) . IEEE, 2021, pp. 150–162

2021

Earlier work this paper cites.

F. Wen, E. Aghajani, C. Nagy, M. Lanza, and G. Bavota, “Siri, write the next method,” in 2021 IEEE/ACM 43rd International Conference on Software Engineering (ICSE) . IEEE, 2021, pp. 138–149

2021

Earlier work this paper cites.

E. Nijkamp, B. Pang, H. Hayashi, L. Tu, H. Wang, Y. Zhou, S. Savarese, and C. Xiong, “Codegen: An open large language model for code with multi-turn program synthesis,” arXiv preprint arXiv:2203.13474 , 2022

Original

2022

Earlier work this paper cites.

M. Izadi, R. Gismondi, and G. Gousios, “Codefill: Multi-token code completion by jointly learning from structure and naming sequences,” in Proceedings of the 44th International Conference on Software Engineering , 2022, pp. 401–412

2022

Earlier work this paper cites.

W. Zhou, S. Kim, V. Murali, and G. A. Aye, “Improving code autocompletion with transfer learning,” in Proceedings of the 44th International Conference on Software Engineering: Software Engineering in Practice , 2022, pp. 161–162

2022

Earlier work this paper cites.

Y. Liu, S. Yavuz, R. Meng, D. Radev, C. Xiong, and Y. Zhou, “Uni-parser: Unified semantic parser for question answering on knowledge base and database,” arXiv preprint arXiv:2211.05165 , 2022

Original

2022

Earlier work this paper cites.

S. Lu, N. Duan, H. Han, D. Guo, S.-w. Hwang, and A. Svyatkovskiy, “Reacc: A retrieval-augmented code completion framework,” arXiv preprint arXiv:2203.07722 , 2022

Original

2022

Earlier work this paper cites.

C. Yu, G. Yang, X. Chen, K. Liu, and Y. Zhou, “Bashexplainer: Retrieval-augmented bash code comment generation based on fine-tuned codebert,” in 2022 IEEE International Conference on Software Maintenance and Evolution (ICSME) . IEEE, 2022, pp. 82–93

2022

Cited alongside, same era.

S. Zhou, U. Alon, F. F. Xu, Z. Wang, Z. Jiang, and G. Neubig, “Docprompting: Generating code by retrieving the docs,” arXiv preprint arXiv:2207.05987 , 2022

Original

2022

Cited alongside, same era.

D. Zan, B. Chen, Z. Lin, B. Guan, Y. Wang, and J.-G. Lou, “When language model meets private library,” arXiv preprint arXiv:2210.17236 , 2022

Original

2022

Cited alongside, same era.

A. Madaan, S. Zhou, U. Alon, Y. Yang, and G. Neubig, “Language models of code are few-shot commonsense learners,” arXiv preprint arXiv:2210.07128 , 2022

Original

2022

Cited alongside, same era.

W. Zhong, R. Cui, Y. Guo, Y. Liang, S. Lu, Y. Wang, A. Saied, W. Chen, and N. Duan, “Agieval: A human-centric benchmark for evaluating foundation models,” arXiv preprint arXiv:2304.06364 , 2023

Original

2023

Later among the works it cites.

M. Liu, Y. Yang, Y. Lou, X. Peng, Z. Zhou, X. Du, and T. Yang, “Recommending analogical apis via knowledge graph embedding,” in Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering , 2023, pp. 1496–1508

2023

Later among the works it cites.

J. Li, G. Li, C. Tao, H. Zhang, F. Liu, and Z. Jin, “Large language model-aware in-context learning for code generation,” arXiv preprint arXiv:2310.09748 , 2023

Original

2023

Later among the works it cites.

Y. Zhu, J. A. Li, G. Li, Y. Zhao, J. Li, Z. Jin, and H. Mei, “Improving code generation by dynamic temperature sampling,” arXiv preprint arXiv:2309.02772 , 2023

Original

2023

Later among the works it cites.