mlsanityData to 14 Oct 2026

Tests as Prompt: A Test-Driven-Development Benchmark for LLM Code Generation

arXiv 2505.09027 ↗First posted 13 May 2025cs.SE cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

We introduce WebApp1K, a novel benchmark for evaluating large language models (LLMs) in test-driven development (TDD) tasks, where test cases serve as both prompt and verification for code generation. Unlike traditional approaches relying on natural language prompts, our benchmark emphasizes the ability of LLMs to interpret and implement functionality directly from test cases, reflecting real-world software development practices. Comprising 1000 diverse challenges across 20 application domains, the benchmark evaluates LLMs on their ability to generate compact, functional code under the constraints of context length and multi-feature complexity. Our findings highlight instruction following and in-context learning as critical capabilities for TDD success, surpassing the importance of general coding proficiency or pretraining knowledge. Through comprehensive evaluation of 19 frontier models, we reveal performance bottlenecks, such as instruction loss in long prompts, and provide a detailed error analysis spanning multiple root causes. This work underscores the practical value of TDD-specific benchmarks and lays the foundation for advancing LLM capabilities in rigorous, application-driven coding scenarios.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 25 of its 38 references that are in the map. First posted on arXiv 13 May 2025.

Builds on

25 of 38 references.

References · 25

  1. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  2. 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,780
  3. 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,455
  4. 2023SWE-bench: Can Language Models Resolve Real-World GitHub Issues?cited by 3,373
  5. 2022Self-Instruct: Aligning Language Models with Self-Generated Instructionscited by 2,724
  6. 2021An Explanation of In-context Learning as Implicit Bayesian Inferencecited by 938
  7. 2017Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithmcited by 734
  8. 2022DS-1000: A Natural and Reliable Benchmark for Data Science Code Generationcited by 452
  9. 2023Text-to-SQL Empowered by Large Language Models: A Benchmark Evaluationcited by 385
  10. 2024Quiet-STaR: Language Models Can Teach Themselves to Think Before Speakingcited by 301
  11. 2017Thinking Fast and Slow with Deep Learning and Tree Searchcited by 252
  12. 2023ClassEval: A Manually-Crafted Benchmark for Evaluating LLMs on Class-level Code Generationcited by 168
13 more
  1. 2024InFoBench: Evaluating Instruction Following Ability in Large Language Modelscited by 135
  2. 2023Hypothesis Search: Inductive Reasoning with Language Modelscited by 120
  3. 2024What needs to go right for an induction head? A mechanistic study of in-context learning circuits and their formationcited by 89
  4. 2023Batch Prompting: Efficient Inference with Large Language Model APIscited by 85
  5. 2023INSTRUCTEVAL: Towards Holistic Evaluation of Instruction-Tuned Large Language Modelscited by 62
  6. 2023Large Language Model Instruction Following: A Survey of Progresses and Challengescited by 31
  7. 2024Multi-Task Inference: Can Large Language Models Follow Multiple Instructions at Once?cited by 30
  8. 2023Reinforcement Learning from Automatic Feedback for High-Quality Unit Test Generationcited by 21
  9. 2024LLM-Powered Code Vulnerability Repair with Reinforcement Learning and Semantic Rewardcited by 16
  10. 2023Testing LLMs on Code Generation with Varying Levels of Prompt Specificitycited by 12
  11. 2024Instruction Following without Instruction Tuningcited by 12
  12. 2024Code Security Vulnerability Repair Using Reinforcement Learning with Large Language Modelscited by 10
  13. 2023Coarse-Tuning Models of Code with Reinforcement Learning Feedbackcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 4.

5 papers.