REVIEW 5 major objections 6 minor 3 cited by
Code Benchmarks Should Prioritize Rigor, Reliability, and Reproducibility
T0 review · 5 major / 6 minor · reviewed 2026-08-10 · deepseek-v4-flash
Pith's one-line read The paper claims that nearly 70% of code benchmarks for LLMs skip data quality assurance, and offers a 55-criteria checklist to fix construction, evaluation, and release.
desk verdict Useful checklist and a large audit, but the prevalence statistics are not as solid as the packaging suggests — treat them as upper bounds on reported practice, not measured practice. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is HOW2BENCH, a 55-criteria checklist organised around a five-phase lifecycle of benchmark development: Phase 0 design, Phase 1 construction, Phase 2 evaluation, Phase 3 analysis, and Phase 4 release. It does two jobs: it tells future builders what to check at each stage (traceability, deduplication, denoising, test coverage, prompt validation, environment logging, licensing, and so on), and it gives auditors a uniform rubric with which to profile existing benchmarks. The profiling statistics are produced by applying this checklist to 274 benchmarks through manual review of papers and released artifacts.
What would settle it
Re-profile a random sample of the 274 benchmarks against a subset of the 55 criteria with independent coders and check whether the roughly 70% no-quality-assurance, 90% no-coverage, and 50% no-reproducibility figures reproduce; a large drop in those rates would undercut the paper's prevalence claims.
Extended reading notes
Core claim
The paper's central discovery is a systematic quality gap: across 274 code-related benchmarks released from 2014 to 2024, nearly 70% have no data quality assurance, over 90% ignore code coverage when passing tests is the oracle, more than half omit prompts or environment details needed for reproduction, and over 10% are closed or partially closed. Even highly cited benchmarks contain duplicated samples, incorrect reference solutions or tests, obscure result presentations, and leaked sensitive information. Because 18% of the benchmarks feed data into later benchmarks, these flaws can propagate. The paper argues that the path forward is HOW2BENCH, a 55-criteria checklist spanning design, construction, evaluation, analysis, and release, and reports a 49-participant study showing that awareness of these issues is often missing.
Load-bearing premise
The headline percentages rest on the authors' manual judgments about whether each of 274 benchmarks satisfies each of the 55 criteria, and on that sample standing in for code benchmarks as a whole.
Editorial extensions
If this is right
- Benchmark scores from the surveyed corpus should be read as provisional until data-quality and coverage checks are reported.
- Future code benchmark releases can be audited against the 55 criteria before adoption, making compliance a publishable artifact.
- Because over 18% of benchmarks feed data into later benchmarks, fixing quality at the source propagates improvements downstream.
- Reproducibility failures (missing prompts, environments, parameters) can be avoided by treating release-phase criteria as mandatory, not optional.
- The human study suggests awareness gaps, so providing a checklist addresses a knowledge problem, not just an effort problem.
Reading between the lines
- If the 18% inheritance rate among benchmarks is representative, a single low-quality source benchmark could inflate scores across a large descendant tree; measuring whether correcting a source's flawed tests changes descendant scores would test this directly.
- The manual audit could be automated by applying the 55 criteria with an LLM profiler, which would let the same quality census be run continuously on newly released benchmarks.
- Since most criteria are stated in task-neutral terms, the same audit protocol could be run on non-code benchmarks to see whether similar violation rates hold in math, QA, or multimodal evaluation.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes HOW2BENCH, a 55-criteria checklist for code-related benchmark development spanning design, construction, evaluation, analysis, and release. The authors report a profiling study of 274 code-related benchmarks published from 2014 to 2024, claim that nearly 70% of these benchmarks have no data quality assurance measures, that over 90% of test-case-based benchmarks do not report code coverage, that over half omit reproducibility-critical information such as prompts, and that over 10% are not fully open-source. They also present focused case studies of 30 highly cited or recent benchmarks, a propagation analysis showing 18% of benchmarks are reused as data sources, and a questionnaire study of 49 researchers on awareness of benchmark quality issues. The core position is that benchmark construction should prioritize rigor, reliability, and reproducibility.
Significance. If its prevalence statistics were auditable and reproducible, this paper would be an important contribution to LLM code evaluation practice. The HOW2BENCH checklist is concrete, lifecycle-oriented, and plausibly generalizable to other benchmark families. The paper's strongest evidence is qualitative and case-based: duplicated samples in MBPP, an incorrect ground-truth solution in HumanEval, wrong example tests in MBPP, API-key leakage in XSemPLR, and email leakage in CrossVul are concrete, independently checkable problems. The propagation graph (Figure 8) is a useful and underappreciated point, showing how low-quality source benchmarks can contaminate downstream evaluations. However, the headline percentages rest on manual coding of papers and artifacts, with no released coding sheets, no inter-annotator agreement, and no confidence intervals; the paper itself concedes in the Limitations section that the manual analysis 'could lead to oversight and discrepancies in the statistical results.' The study is a solid position paper with a usable checklist, but its central empirical claims need more evidence before they can be treated as established measurements.
major comments (5)
- [Section 3.2 Step 2 / Appendix A.3, Figures 19, 21, 27] The headline statistics conflate 'not mentioned' with 'not done'. For example, Figure 27 reports that 87.8% 'did not mention' test coverage, yet the Abstract states that 'over 90% did not consider code coverage'; Figure 19 reports that 'more than half' of benchmarks 'did not mention' deduplication, while Section 4.2 interprets this as 62% not deduplicating. A benchmark may deduplicate, measure coverage, or manually review data without documenting those steps in the scanned paper or repository. Because process-level criteria such as manual review (criterion 18) cannot be reliably inferred from absence of documentation, the reported rates of 67.9%, 8.7%, and 52.6% are not yet supported. I ask the authors to recode with explicit categories (done, not done, not reported/unknown), to report the 'not reported' category separately, to release the coding sheets and per-benchmark judgments, and to report inter-annotator agreement and confidence intervals.
- [Section 3.2 Step 2 / Limitations, first bullet] The sample of 274 benchmarks is obtained by snowballing, but the paper does not document the search sources, inclusion and exclusion criteria, screening process, or how the final set relates to the population of code-related benchmarks. The strong year-over-year growth, with 149 benchmarks assigned to 2024 alone, suggests the sample is not a uniform snapshot of a decade. Without a PRISMA-style flow or a clear sampling frame, claims such as 'over 90% of benchmarks' cannot be generalized beyond the collected set. The Limitations section acknowledges that 'the collection of code-related benchmarks may be incomplete'; this limitation should be reflected in the phrasing of every aggregate percentage, not only in the appendix.
- [Abstract vs. full text, Sections 1 and Appendix D] The Abstract states that this is 'a decade-scale (2014-2025) survey over 672 code benchmarks' and that 'in 2025 alone' the number of benchmarks ignoring code coverage nearly matches the previous decade's total, while the full text consistently reports 274 benchmarks and a 2014-2024 window. This is a direct factual inconsistency about the corpus size and time span. The authors should correct the Abstract and ensure every occurrence of the corpus size and date range agrees with the body of the paper.
- [Section 5 / Appendix B] The human study's awareness-gap claims are presented with strong quantifiers ('All participants concurred', 'over 40% were not aware') based on 49 self-selected respondents, mostly graduate students with at least one publication, recruited through the authors' academic networks. The paper reports no inferential statistics, confidence intervals, or analysis of nonresponse bias, and the participant pool is not described as representative of benchmark developers. The finding is suggestive and worth reporting, but the claims should be softened or supplemented with a margin of error and a discussion of selection bias. Minor: the demographics report '57.14%' for SE participants, an unjustified precision for a sample of 49; an integer percentage is more appropriate.
- [Section 3.2 Steps 2-3 / Data availability] The paper's own subject is reproducibility, yet the data underlying its main quantitative claims is not released: there is no benchmark list with per-criterion coding decisions, no coding protocol, no raw survey responses, and no analysis scripts. The abstract and introduction present precise numbers (67.9%, 8.7%, 52.6%, etc.) that cannot be audited without these artifacts. Releasing the coding data and a detailed protocol is a minimal requirement for a paper that argues other benchmarks should be reproducible, and it is needed before the prevalence statistics can be accepted.
minor comments (6)
- [Appendix A.1] The sentence 'In total, 724 programming languages are studied by these 274 benchmarks' should be rephrased to indicate that 724 is the total number of benchmark-language pairs, not the number of distinct languages.
- [Figure 8] The inheritance graph appears to be a screenshot with garbled labels and a local file path ('graph_sample.html') visible; this is not publication quality and should be redrawn with readable text.
- [Section 4.3] The phrase 'transparency and matriculated documents' should be 'transparency and meticulous documentation'.
- [Section 4.1 / Appendix A.1] The text refers to 'Defeat Detection' where 'Defect Detection' is intended; check for this typo in both places.
- [Figure 26] The heading 'Test Orcale' should be 'Test Oracle'.
- [Figure 7 / Appendix E, criterion 48] The criterion begins with a lowercase 'review' after the numbered item; this should be capitalized for consistency with the other items.
Circularity Check
No circularity: HOW2BENCH is derived from literature and practitioner interviews, then applied to profile benchmarks; the few self-citations are not load-bearing.
full rationale
The paper's derivation chain is descriptive and non-circular. HOW2BENCH is constructed in Step 1 from literature (Suppes et al., 1962; Zheng et al., 2023b; Schaefer et al., 2024; Reuel et al., 2024) and stakeholder interviews, before any profiling occurs. Step 2 applies the finalized 55 criteria to the 274 collected benchmarks; the checklist is not fitted to the profiled data, and no quantity measured during profiling is used to define or retroactively adjust the criteria. Step 3's focused case study and Step 4's human study are separate validations of the checklist's usefulness, not derivations of the prevalence statistics. The paper's own Limitations section concedes that "the study involved substantial manual analysis, which could lead to oversight and discrepancies in the statistical results," which is a measurement-validity caveat rather than evidence that a result is defined in terms of its input. Self-citations such as JavaBench, CRUXEval-X, DomainEval, and Cao et al. 2024a/b appear only as benchmarks in the collection or as supporting prior observations; none is load-bearing for the central claim that most benchmarks lack quality-assurance, coverage, and reproducibility practices. There is no equation, fitted parameter, or imported uniqueness theorem whose output reduces to its input, so no circular step can be exhibited.
Assumptions & free parameters
assumptions (2)
- domain assumption The 274 collected benchmarks are representative of code-related benchmarks released between 2014 and 2024.
- domain assumption Manual profiling judgments about whether each benchmark satisfies each criterion are accurate.
Cite this review
Pith. "Pith review of Code Benchmarks Should Prioritize Rigor, Reliability, and Reproducibility." pith.science (2026). https://pith.science/paper/DXOIU5VT
@misc{pith2026250110711,
author = {Pith},
title = {Pith review of: Code Benchmarks Should Prioritize Rigor, Reliability, and Reproducibility},
year = {2026},
howpublished = {\url{https://pith.science/paper/DXOIU5VT}},
note = {Machine review of arXiv:2501.10711}
}
read the original abstract
Code-related benchmarks play a critical role in evaluating large language models (LLMs), yet their quality fundamentally shapes how the community interprets model capabilities. In the past few years, awareness of benchmark quality has grown. Yet, after a decade-scale (2014-2025) survey over 672 code benchmarks, we observed a lag between growing awareness and actual practice. For example, in 2025 alone, the number of benchmarks that ignore code coverage when providing test cases nearly matches the total count accumulated across the previous ten years. In response, we take a clear position: Code benchmarks must prioritize rigor in benchmark construction, reliability in evaluation, and reproducibility in release. To operationalize this position, we introduce a code benchmark guideline HOW2BENCH with 55 checklists. Finally, our further human study also exposed that the current issues not only stem from the significant effort required, but also from a lack of awareness regarding their importance.
Figures
Figures from the paper (33 more)
Forward citations
Cited by 3 Pith papers
-
To Add Is Machine, To Delete Is Human: Measuring and Mitigating Deletion Avoidance in LLM Code Editing
Even test-passing LLM patches keep code developers deleted; a 200-task deletion-only benchmark and 0.7% post-training data show the behavior is measurable and learnable.
-
Establishing Best Practices for Building Rigorous Agentic Benchmarks
Agentic benchmarks frequently mis-grade agents, and the new ABC checklist helps identify and correct such errors in ten popular benchmarks.
-
A Conceptual Framework for AI Capability Evaluations
A descriptive conceptual framework with seven elements (target, task, subject, inputs, instance, measurement, result analysis) for systematizing analysis of AI capability evaluations.
Reference graph
Works this paper leans on
-
[4]
code2seq: Generating sequences from struc- tured representations of code. In 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019 . OpenRe- view.net. Aida Amini, Saadia Gabriel, Shanchuan Lin, Rik Koncel-Kedziorski, Yejin Choi, and Hannaneh Ha- jishirzi. 2019. MathQA: Towards interpretable math word prob...
arXiv 2019
-
[7]
arXiv preprint arXiv:2401.03065
Cruxeval: A benchmark for code reason- ing, understanding and execution. arXiv preprint arXiv:2401.03065. Xiaodong Gu, Hongyu Zhang, and Sunghun Kim. 2018. Deep code search. In Proceedings of the 40th Inter- national Conference on Software Engineering, ICSE 2018, Gothenburg, Sweden, May 27 - June 03, 2018, pages 933–944. ACM. Jiawei Guo, Ziming Li, Xuelin...
arXiv 2018
-
[8]
On the impacts of contexts on repository-level code generation. Preprint, arXiv:2406.11927. Patrick Haller, Jonas Golde, and Alan Akbik. 2024. PECC: problem extraction and coding challenges. In Proceedings of the 2024 Joint International Con- ference on Computational Linguistics, Language Re- sources and Evaluation, LREC/COLING 2024, 20-25 May, 2024, Tori...
arXiv 2024
-
[9]
Infiagent-dabench: Evaluating agents on data analysis tasks. In Forty-first International Confer- ence on Machine Learning, ICML 2024, Vienna, Aus- tria, July 21-27, 2024. OpenReview.net. Yang Hu, Umair Z. Ahmed, Sergey Mechtaev, Ben Leong, and Abhik Roychoudhury. 2019. Re- factoring based program repair applied to program- ming assignments. In 2019 34th ...
arXiv 2024
-
[15]
Deep learning-based vulnerable function de- tection: A benchmark. In Information and Commu- nications Security - 21st International Conference, ICICS 2019, Beijing, China, December 15-17, 2019, Revised Selected Papers, volume 11999 of Lecture Notes in Computer Science, pages 219–232. Springer. Guanjun Lin, Jun Zhang, Wei Luo, Lei Pan, Olivier Y . de Vel, ...
arXiv 2019
-
[16]
did you miss my comment or what?
Nl2type: inferring javascript function types from natural language information. In Proceedings of the 41st International Conference on Software En- gineering, ICSE 2019, Montreal, QC, Canada, May 25-31, 2019, pages 304–315. IEEE / ACM. Courtney Miller, Sophie Cohen, Daniel Klug, Bogdan Vasilescu, and Christian KaUstner. 2022. "did you miss my comment or w...
arXiv 2019
-
[19]
Can openai’s codex fix bugs?: An evaluation on quixbugs. In 3rd IEEE/ACM International Work- shop on Automated Program Repair, APR@ICSE 2022, Pittsburgh, PA, USA, May 19, 2022 , pages 69–75. IEEE. Julian Aron Prenner and Romain Robbes. 2023. Runbu- grun - an executable dataset for automated program repair. CoRR, abs/2304.01102. Ruizhong Qiu, Weiliang Will...
arXiv 2022
-
[20]
Betterbench: Assessing ai benchmarks, uncov- ering issues, and establishing best practices. Preprint, arXiv:2411.12990. Niklas Risse and Marcel Böhme. 2024. Uncovering the limits of machine learning for automatic vulnerabil- ity detection. In 33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, Au- gust 14-16, 2024. USENIX Associat...
arXiv 2024
Show all 36 references
-
[21]
ACM Comput
Qa dataset explosion: A taxonomy of nlp resources for question answering and reading com- prehension. ACM Comput. Surv., 55(10). Baptiste Rozière, Marie-Anne Lachaux, Lowik Chanus- sot, and Guillaume Lample. 2020. Unsupervised translation of programming languages. In Advances ...
2020
-
[22]
In The Tenth International Conference on Learning Representations, ICLR 2022, Virtual Event, April 25-29, 2022
Leveraging automated unit tests for unsuper- vised code translation. In The Tenth International Conference on Learning Representations, ICLR 2022, Virtual Event, April 25-29, 2022. OpenReview.net. Rebecca L. Russell, Louis Y . Kim, Lei H. Hamilton, Tomo Lazovich, Jacob Harer, ...
2022
-
[23]
In Findings of the Association for Computational Linguistics: EMNLP 2023, pages 10776–10787, Sin- gapore
NLP evaluation in trouble: On the need to mea- sure LLM data contamination for each benchmark. In Findings of the Association for Computational Linguistics: EMNLP 2023, pages 10776–10787, Sin- gapore. Association for Computational Linguistics. Irina Saparina and Mirella Lapata...
2023 arXiv
-
[24]
In The Twelfth International Conference on Learning Representations, ICLR 2024, Vienna, Austria, May 7-11, 2024
Learning performance-improving code edits. In The Twelfth International Conference on Learning Representations, ICLR 2024, Vienna, Austria, May 7-11, 2024. OpenReview.net. Chenglei Si, Yanzhe Zhang, Zhengyuan Yang, Ruibo Liu, and Diyi Yang. 2024. Design2code: How far are we fr...
2024 arXiv
-
[26]
Preprint, arXiv:1907.10701
Benchmarking tpu, gpu, and cpu platforms for deep learning. Preprint, arXiv:1907.10701. Zhiruo Wang, Grace Cuenca, Shuyan Zhou, Frank F. Xu, and Graham Neubig. 2023b. Mconala: A benchmark for code generation from multiple natural languages. In Findings of the Association for C...
1907 arXiv
-
[27]
Jason Wei, Xuezhi Wang, Dale Schuurmans, Maarten Bosma, Brian Ichter, Fei Xia, Ed H
Jailbroken: How does llm safety training fail? Advances in Neural Information Processing Systems, 36. Jason Wei, Xuezhi Wang, Dale Schuurmans, Maarten Bosma, Brian Ichter, Fei Xia, Ed H. Chi, Quoc V . Le, and Denny Zhou. 2022. Chain-of-thought prompt- ing elicits reasoning in ...
2022
-
[28]
Chengyue Wu, Yixiao Ge, Qiushan Guo, Jiahao Wang, Zhixuan Liang, Zeyu Lu, Ying Shan, and Ping Luo
OpenReview.net. Chengyue Wu, Yixiao Ge, Qiushan Guo, Jiahao Wang, Zhixuan Liang, Zeyu Lu, Ying Shan, and Ping Luo. 2024a. Plot2code: A comprehensive benchmark for evaluating multi-modal large language models in code generation from scientific plots. CoRR, abs/2405.07990. Tongt...
2024 arXiv
-
[29]
CoRR, abs/2408.13001
Cruxeval-x: A benchmark for multilingual code reasoning, understanding and execution. CoRR, abs/2408.13001. Ankit Yadav, Himanshu Beniwal, and Mayank Singh. 2024a. Pythonsaga: Redefining the benchmark to evaluate code generating llms. In Findings of the Association for Computa...
2024 arXiv
-
[30]
CoRR, abs/2406.06918
Towards more realistic evaluation of llm-based code generation: an experimental study and beyond. CoRR, abs/2406.06918. Qinkai Zheng, Xiao Xia, Xu Zou, Yuxiao Dong, Shan Wang, Yufei Xue, Lei Shen, Zihan Wang, Andi Wang, Yang Li, Teng Su, Zhilin Yang, and Jie Tang. 2023a. Codeg...
2021 arXiv
-
[32]
0 1000 2000 3000 0 10 20 30 40 50 60 70 80 90 100 110 120 130 140 150 160 170 180 190 Citations Figure 10: Citation Distribution of Benchmarks Coding Task
From Figure 10, we can see a clear long- tail trend of the citations, from the highest 2735 (HumanEval (Chen et al., 2021a)) to the lowest 0. 0 1000 2000 3000 0 10 20 30 40 50 60 70 80 90 100 110 120 130 140 150 160 170 180 190 Citations Figure 10: Citation Distribution of Ben...
2000
-
[33]
For example, Hu- manEval (Chen et al., 2021a) and MBPP (Austin et al., 2021)), class-level (i.e., a class with mul- tiple function units of code
and Math-QA (Amini et al., 2019)), function- level (i.e., a function unit of code. For example, Hu- manEval (Chen et al., 2021a) and MBPP (Austin et al., 2021)), class-level (i.e., a class with mul- tiple function units of code. For example, Clas- sEval (Du et al., 2023b)) and...
2019
-
[35]
"" if len(dict.keys()) == 0: return False else: state =
that failed to be executed. Data Contamination Resolution. Data con- tamination (Golchin and Surdeanu, 2023; Cao et al., 2024b) threat has been widely discussed. A benchmark with contaminated data may yield overclaimed results, misleading the understand- ing of the LLMs’ capab...
2023
-
[36]
assert upper_ctr('PYthon') == 1
where the test is incorrect. It alerts us that both the quality of the test and the test adequacy (e.g., code coverage) should be considered. Wrong Example Tests { 'source_file': 'charlessutton@: Benchmark Questions Verification V2.ipynb', 'task_id’: 461, 'prompt': 'Write a py...
2021
-
[294]
Pengyu Nie, Rahul Banerjee, Junyi Jessy Li, Raymond J
ACM. Pengyu Nie, Rahul Banerjee, Junyi Jessy Li, Raymond J. Mooney, and Milos Gligoric. 2023. Learning deep semantics for test completion. In 45th IEEE/ACM International Conference on Software Engineering, ICSE 2023, Melbourne, Australia, May 14-20, 2023, pages 2111–2123. IEEE...
2023 arXiv
-
[516]
Woosuk Kwon, Zhuohan Li, Siyuan Zhuang, Ying Sheng, Lianmin Zheng, Cody Hao Yu, Joseph E
Association for Computational Linguistics. Woosuk Kwon, Zhuohan Li, Siyuan Zhuang, Ying Sheng, Lianmin Zheng, Cody Hao Yu, Joseph E. Gonzalez, Hao Zhang, and Ion Stoica. 2023. Effi- cient memory management for large language model serving with pagedattention. In Proceedings of...
2023 arXiv
-
[1442]
Mingsheng Jiao, Tingrui Yu, Xuan Li, Guanjie Qiu, Xiaodong Gu, and Beijun Shen
IEEE. Mingsheng Jiao, Tingrui Yu, Xuan Li, Guanjie Qiu, Xiaodong Gu, and Beijun Shen. 2023. On the eval- uation of neural code translation: Taxonomy and benchmark. In 38th IEEE/ACM International Con- ference on Automated Software Engineering, ASE 2023, Luxembourg, September 11...
2023 arXiv
-
[1569]
Wonseok Oh and Hakjoo Oh
ACM. Wonseok Oh and Hakjoo Oh. 2022. Pyter: effective pro- gram repair for python type errors. In Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC/FSE 2022, Singapore, Singapore, November ...
2022 arXiv
-
[2014]
In 30th IEEE International Conference on Software Maintenance and Evolution, Victoria, BC, Canada, September 29 - October 3, 2014, pages 476–480
Towards a big data curated benchmark of inter-project code clones. In 30th IEEE International Conference on Software Maintenance and Evolution, Victoria, BC, Canada, September 29 - October 3, 2014, pages 476–480. IEEE Computer Society. Xiangru Tang, Bill Qian, Rick Gao, Jiakan...
2014 arXiv
-
[2017]
CoRR, abs/1709.00103
Seq2sql: Generating structured queries from natural language using reinforcement learning. CoRR, abs/1709.00103. Yaqin Zhou, Shangqing Liu, Jing Kai Siow, Xiaoning Du, and Yang Liu. 2019. Devign: Effective vul- nerability identification by learning comprehensive program semant...
2019 arXiv
-
[2018]
Dianshu Liao, Shidong Pan, Xiaoyu Sun, Xiaoxue Ren, Qing Huang, Zhenchang Xing, Huan Jin, and Qinying Li
The Internet Society. Dianshu Liao, Shidong Pan, Xiaoyu Sun, Xiaoxue Ren, Qing Huang, Zhenchang Xing, Huan Jin, and Qinying Li. 2024. A 3-codgen: A repository-level code generation framework for code reuse with local- aware, global-aware, and third-party-library-aware. IEEE Tr...
2024
-
[2019]
Juice: A large scale distantly supervised dataset for open domain context-based code gener- ation. In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Nat- ural Language Processing, EMNLP-IJCNL...
2019
-
[2020]
In Proceedings of the 28th International Confer- ence on Computational Linguistics, COLING 2020, Barcelona, Spain (Online), December 8-13, 2020 , pages 26–38
Building hierarchically disentangled lan- guage models for text generation with named enti- ties. In Proceedings of the 28th International Confer- ence on Computational Linguistics, COLING 2020, Barcelona, Spain (Online), December 8-13, 2020 , pages 26–38. International Commit...
2020
-
[2021]
measure the ability of these models to synthesize short Python programs from natural language descriptions
aims to “measure the ability of these models to synthesize short Python programs from natural language descriptions” for “entry-level program- mers”. As we can see from Figure 17, the prompt requires LLMs to “ Write a function to calculate the dogs’ years .” Simply from this d...
2021
-
[2022]
Science, 378(6624):1092–1097
Competition-level code generation with alpha- code. Science, 378(6624):1092–1097. Zehan Li, Jianfei Zhang, Chuantao Yin, Yuanxin Ouyang, and Wenge Rong. 2024e. Procqa: A large- scale community-based programming question an- swering dataset for code search. In Proceedings of th...
2024 arXiv
-
[2023]
In 45th IEEE/ACM International Conference on Software Engineering, ICSE 2023, Melbourne, Australia, May 14-20, 2023, pages 1430–
Impact of code language models on automated program repair. In 45th IEEE/ACM International Conference on Software Engineering, ICSE 2023, Melbourne, Australia, May 14-20, 2023, pages 1430–
2023
-
[2024]
O’Reilly Media, Inc
Long code arena: a set of benchmarks for long-context code models. CoRR, abs/2406.11612. Jialun Cao, Zhiyong Chen, Jiarong Wu, Shing-Chi Che- ung, and Chang Xu. 2024a. Can AI beat under- graduates in entry-level java assignments? bench- marking large language models on javaben...
2022 arXiv
-
[5445]
Lakshya A
Association for Computational Linguistics. Lakshya A. Agrawal, Aditya Kanade, Navin Goyal, Shuvendu K. Lahiri, and Sriram K. Rajamani. 2023. Monitor-guided decoding of code lms with static anal- ysis of repository context. In Advances in Neural Information Processing Systems 3...
2023
-
[8474]
Ramakrishna Bairi, Atharv Sonwane, Aditya Kanade, Vageesh D
Association for Computational Linguistics. Ramakrishna Bairi, Atharv Sonwane, Aditya Kanade, Vageesh D. C., Arun Iyer, Suresh Parthasarathy, Sri- ram K. Rajamani, Balasubramanyan Ashok, and Shashank Shet. 2024. Codeplan: Repository-level coding using llms and planning. Proc. A...
2024
Reviewed August 10, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.