Automatic Generation of Benchmarks and Reliable LLM Judgment for Code Tasks
Not on the map. Why?
Abstract (arXiv)
LLMs can be used in a variety of code related tasks such as translating from one programming language to another, implementing natural language requirements and code summarization. Artifacts generated by state of the art LLM technology are expected to be useful in the sense that a user will be able to use the LLM generated artifact after a small number of easy modifications. Quantifying this vague notion is challenging and it is thus hard to determine the quality of code related LLM solutions. We refer to evaluation of LLM solutions using LLM judgment as "LLM as a Judge", or LaaJ for short. In this work we introduce a methodology to generate and evaluate LaaJ implementations, utilizing an automatically generated benchmark. The purpose of the benchmark is two fold, namely, it is used both to develop and validate the LaaJs and to validate and test the LLM code related solution using the LaaJs. To that end, we developed an automated benchmark generation engine, which generates code in multiple programming languages for multiple code related tasks and which serves as the input for LaaJ evaluation. We utilize a graph representation, G, of the potential code related generations. The graph vertices are generated artifacts and edges represent possible generations, e.g., the generation of a Java program from its natural language requirements. Utilizing a chain of LLM agents and G we generate code related artifacts. Using cycles in G we formulate expectations on the generated artifacts. Taking advantage of these formulated expectations enables the development and testing of reliable LLM judgement for usefulness of the artifacts generated by the solution. Our approach enables the creation of high quality code task solutions.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Oct 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 6; 2026: 1.
7 papers.
- 2025Large Language Models (LLMs) for Source Code Analysis: applications, models and datasetscited by 15
- 2025CML-Bench: A Framework for Evaluating and Enhancing LLM-Powered Movie Scripts Generationcited by 6
- 2025Silencer: From Discovery to Mitigation of Self-Bias in LLM-as-Benchmark-Generatorcited by 4
- 2025When LLMs Benchmark Themselves: Deconstructing Self-Bias in Automated Evaluationcited by 2
- 2025Automating Benchmark Designcited by 2
- 2025Technique to Baseline QE Artefact Generation Aligned to Quality Metricscited by 0
- 2026SciCustom: A Framework for Custom Evaluation of Scientific Capabilities in Large Language Modelscited by 0
- 2026SciCustom: A Framework for Custom Evaluation of Scientific Capabilities in Large Language Models19 May 2026
- 2025Technique to Baseline QE Artefact Generation Aligned to Quality Metrics18 Nov 2025
- 2025Automating Benchmark Design28 Oct 2025
- 2025CML-Bench: A Framework for Evaluating and Enhancing LLM-Powered Movie Scripts Generation1 Oct 2025
- 2025When LLMs Benchmark Themselves: Deconstructing Self-Bias in Automated Evaluation30 Sep 2025
- 2025Silencer: From Discovery to Mitigation of Self-Bias in LLM-as-Benchmark-Generator27 May 2025
- 2025Large Language Models (LLMs) for Source Code Analysis: applications, models and datasets21 Mar 2025
Similar, not cited
Close in wording, no citation either way
- 2025Web-Bench: A LLM Code Benchmark Based on Web Standards and Frameworks
- 2025Beyond Synthetic Benchmarks: Evaluating LLM Performance on Real-World Class-Level Code Generation
- 2025LLM4VV: Evaluating Cutting-Edge LLMs for Generation and Evaluation of Directive-Based Parallel Programming Model Compiler Tests ↗
- 2025LLM-as-a-Judge for Software Engineering: Literature Review, Vision, and the Road Ahead ↗
- 2025CodeJudgeBench: Benchmarking LLM-as-a-Judge for Coding Tasks
- 2025Holistic Evaluation of State-of-the-Art LLMs for Code Generation
- 2026Rethinking Code Performance Benchmarks for LLMs
- 2025EffiBench-X: A Multi-Language Benchmark for Measuring Efficiency of LLM-Generated Code