Pith

open record

sign in

arxiv: 2607.02854 · v1 · pith:SGXTMIW2 · submitted 2026-07-03 · cs.SE · cs.LG

EvoOtter: Evolutionary Reproduction Test Generator

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:SGXTMIW2record.jsonopen to challenge →

classification cs.SE cs.LG
keywords evolutionarybrtscostsevootterfeedbackissueprogrammingtest
0
0 comments X
read the original abstract

Before fixing an issue, it is useful to first reproduce it by generating a bug reproduction test (BRT). However, generating a BRT is itself a challenging task, because issue descriptions tend to be informal, making it difficult to determine whether a candidate BRT indeed fails for the reason in the issue. Prior work has attempted to tackle this problem via inference scaling, using large language models to generate many BRTs and patches, then using execution feedback to select and improve them. Unfortunately, this is expensive and the feedback is unreliable. This paper explores evolutionary programming for BRT generation to sharpen the feedback, while enhancing evolutionary programming to keep costs in check. Our new approach, EvoOtter, controls test execution costs via successive halving. Furthermore, it controls LLM costs via batched crossover for an entire generation in a single LLM call, as well as via rule-based code mutations, with a new fitness score tailored for BRTs. As a result, EvoOtter generates state-of-the-art quality BRTs at the fraction of the cost of prior inference-scaling approaches to this problem. More broadly, this paper points at how to efficiently and effectively combine evolutionary programming with large language models for software engineering.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.