Skip to content
Review

OdinEval: A Reproducible Benchmark for LLM-Based Program Repair in the Odin Programming Language

Aug 2026 · 0 citations · 29 references
Computer Science

TL;DR

OdinEval is presented, a reproducible benchmark built from documented defects in public Odin repositories built from documented defects in public Odin repositories, that evaluates six language models on 168 filtered instances under one shared protocol.

Abstract

Repository-level repair benchmarks still center on a few mainstream languages, leaving systems languages such as Odin largely untested. We present OdinEval, a reproducible benchmark built from documented defects in public Odin repositories. Each instance binds an issue to base and fix commits, a gold patch, an issue-specific regression test, a historical toolchain, and execution records. Admission requires the test to fail on the base revision and pass after the gold fix. When no usable developer test exists, a black-box test is reviewed independently by three instances of the same model, executed in both historical states, and revised from recorded feedback under a versioned Test Writing Skill. We evaluate six language models on 168 filtered instances under one shared protocol. Kimi-K3 records the highest Resolved score at 66.7%, while Qwen3.8-Max has the highest Repro score at 96.4%. The release includes frozen data, source archives, containers, validators, model patches, and audit manifests.

View source

Similar papers

Preprint Aug 2026

AppEval: A Unified Benchmark for LLM-Based Mobile Application Repair in ArkTS, Swift, and Kotlin

AppEval is presented, a benchmark and native-toolchain evaluation framework for mobile application repair across HarmonyOS/ArkTS, iOS/Swift, and Android/Kotlin, and shows that mobile repair performance depends strongly on the evaluated agent while demonstrating why runtime-aware acceptance is necessary for meaningful comparison.

Bang Xie, Hao Liu, Zhenyu Shi et al. · 0 citations
Review Open access Jul 2026

MigBench: An Execution Certified Benchmark for Large Language Model Review and Repair of MongoDB Data Migrations

Production data migrations run with write credentials, often while the application they serve continues to handle traffic, and their worst failure modes concern how they change data rather than whether the code runs. Language model reviewers are increasingly asked to gate such scripts, with little evidence about their reliability in this setting. This paper presents MigBench, a benchmark of 300 MongoDB migration scripts in which 100 are correct and 200 each contain exactly one defect from eight operationally defined categories. The dataset is generated deterministically from a single seed, and every label is certified by execution: each script runs against a disposable MongoDB replica set under five behavioral probes covering expected state and scope, repeated execution, a counter race against simulated live traffic, crash injection with an invariant across collections, and crash injection followed by resume. All 300 labels were confirmed by behavior before any reviewer ran.

Ahmed F. Mohamed · 0 citations
Review Aug 2026

Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair

This paper identifies patch verbosity as a major yet overlooked concern in LLM-based APR and proposes RECAP, a lightweight, plug-and-play adapter that attaches to existing repair frameworks after generation that achieves a substantially better size-correctness tradeoff.

Wen-Qiang Luo, J. Keung, Xiaoyu Shi et al. · 0 citations
Jul 2026

The Patchwork Problem in LLM-Generated Code

This paper formalizes structural coherence as consistency invariants over graph representations of repository artifacts, including import, call, dependency, configuration, schema, resource, control-flow, and routing graphs, and introduces an eight-category failure taxonomy distinguishing defects specific to LLM generation from those merely amplified by it.

Viraaji Mothukuri, R. Parizi · 0 citations
Preprint Jul 2026

Benchmarking Large Language Models on Repairing Qiskit Programs using Bugs4Q

In quantum programs, Bugs4Q is a widely used benchmark containing real quantum defects. However, its evaluation assumes that benchmark labels remain valid and that generated fixes execute in the target environment. We evaluate two Bugs4Q versions containing 67 unique real Qiskit defects, adding executable tests where missing, and re-run all entries across six pinned Qiskit releases (0.25.0, 0.45.0, 1.0.0, 1.1.1, 2.0.0, and 2.3.1). We find that quantum benchmarks can suffer from silent label inversion: entries become invalid without errors when reference fixes stop executing or buggy programs no longer reproduce failures. Thus, correctness depends on the (benchmark, version) pair rather than the benchmark alone. We evaluate four LLMs (GPT-4o-mini, GPT-5o-mini, GPT-5.4, and GPT-5.4-mini), generating up to 10 repair candidates per defect and testing them across all versions. GPT-5.4 achieves the highest pass@10 (48.8%), followed by GPT-5.4-mini (47.3%), GPT-5o-mini (30.3%), and GPT-4o-mini (22.6%). All models perform best on Qiskit 0.45.0 and decline after the Qiskit 1.0 transition. Many failures arise from deprecated or incompatible APIs rather than incorrect repairs, and 64\% of successful repairs occur on entries invalid under the target version. We release a re-validated, version-pinned Bugs4Q benchmark and show that benchmark validation must precede repair evaluation.

Saumya Brahmbhatt, Mitali Hukkeri, Dongchan Kim et al. · 0 citations
Preprint Aug 2026

DepWareTrans: Dependency-Aware Incremental Repository Migration across Co-executable Languages

This paper proposes a dependency-aware incremental migration framework that elevates the unit of translation from individual files to dependency-consistent batches and improves scalability and reliability in repository-level code translation.

Sivajeet Chand, Alexander Pretschner, Steve Haupt et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.