Answers are grounded in this paper and cite their sources.
Budgeted candidate verification couples where tests are allocated with how much evidence is required before accepting an implementation. We examine this interaction in a controlled, reference-oracle-assisted study of {} selected QuixBugs algorithms and {} candidate implementations, including deterministic single-edit mutants and a planted reference. All candidate outcomes are obtained by executing code. Four transparent scheduling policies observe only charged verification outcomes, and a distinct input pool provides final evaluation. With a one-test developer gate, 32 additional candidate-test queries, and eight required passing probes, candidate-focused allocation yields % useful coverage and % false acceptance, compared with % and % for round robin. Useful coverage counts accepted candidates that match every held-out case; it is not proof of semantic correctness. The coverage advantage must be interpreted alongside increased observed false acceptance and a counting argument showing how distributed testing can miss the acceptance threshold. Stronger developer gates, budget and threshold ablations, and failure-history baselines are retained. The contribution is an auditable protocol illustrating why allocation, abstention, initial suite strength, and oracle access must be reported together. The study introduces no new scheduling algorithm and establishes no performance claim for real repository patches or autonomous repair systems.
No takes yet. Share an insight, caveat, or question.
Krishna Varun Kasamneni (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: