{ "schema_version": 1, "builder_plan": { "scenario": "Your coding assistant makes changes that still need substantial repair before merging.", "change": "Try the technique on held-out issues from a repository with reliable tests.", "baseline": "The same coding agent, repository snapshot, tools, and token budget.", "steps": [ "Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.", "Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.", "Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.", "Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test." ], "measure": "Correct patches, regression failures, human repair time, and total cost per accepted change.", "decision": "Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation." }, "builder_review": null, "arxiv_id": "2610.23241", "title": "Towards Agentic Proof Harness Engineering", "summary": "The method replaces manual proof-harness engineering, in which verification engineers write symbolic inputs, initialization code, and dependency models for a target unit, with an LLM coding agent that constructs and refines harnesses under formal soundness and precision guards. It costs an agentic LLM workflow plus a working formal-verification toolchain such as CBMC, and the evaluation covers only three pre-existing bugs in two C projects, so there is no measured speed, cost, or coverage improvement. It can fail through unsound or imprecise dependency abstractions that the guards miss, targets outside the demonstrated C/CBMC setting, and projects lacking suitable assertion-level properties.", "rationale": "The result is a promising but small-scale feasibility study tied to a formal-verification workflow that most ML production teams do not operate, so it warrants monitoring rather than adoption unless the team already maintains CBMC-style verification pipelines.", "technique": "Agentic generation of formal proof harnesses", "family": "agentes_de_codigo", "recommendation": "observar", "published": "2026-10-16", "as_of": "2026-10-19", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2610.23241", "independent_implementations": 0, "total_implementations": 0, "stars": 0, "citations": null, "claims": [ { "claim_id": "claim-01", "statement": "The method replaces manual proof-harness engineering, in which verification engineers write symbolic inputs, initialization code, and dependency models for a target unit, with an LLM coding agent that constructs and refines harnesses under formal soundness and precision guards. It costs an agentic LLM workflow plus a working formal-verification toolchain such as CBMC, and the evaluation covers only three pre-existing bugs in two C projects, so there is no measured speed, cost, or coverage improvement. It can fail through unsound or imprecise dependency abstractions that the guards miss, targets outside the demonstrated C/CBMC setting, and projects lacking suitable assertion-level properties.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.23241", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "No quantitative improvement factor is reported. In an exploratory case study on curl and libuv, the agent built harnesses enabling CBMC to detect all three known historical assertion violations (3/3 targets), with harness reuse across verification tools demonstrated qualitatively.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.23241", "source_page": null, "source_excerpt": "" } ], "exposure_map": [ { "dimension": "quality", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compute", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "latency", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "operations", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compatibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "security", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "data_and_training", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "reproducibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" } ], "risks": [], "minimum_test": [], "open_questions": [], "independent_tests": [], "lab_reproductions": [], "report_available": false, "validation_tier": "unknown", "evidence_tier": "unknown", "infrastructure_basis": "unknown", "equations": [], "equations_status": "not_fetched", "core_kind": "", "equations_fetched_at": "", "equations_source_url": "", "equations_source_sha256": "", "exposures_reviewed_at": "", "exposures_source_sha256": "" }