Counterexample-Guided Refinement

Overview

Counterexample-guided refinement improves a model, specification, program, or evaluator by proposing a candidate, checking it with a verifier or test environment, then using concrete failures to revise it. Formal methods use CEGAR and CEGIS loops with abstraction, SAT/SMT solving, symbolic execution, contracts, and invariant synthesis; newer systems apply similar feedback loops to LLM-generated code, specifications, planning heuristics, and compiled knowledge. Benchmarks include Frama-C and VerifyThis programs, planning domains, regex induction, and code-generation suites, where counterexamples can improve sample efficiency and expose errors missed by static checks. A key challenge is getting feedback that is valid and informative: bounded search, weak or noisy oracles, and repeated revisions can limit correctness, generalization, and convergence.

Latest papers

CardsList

17 papers3 papers in the last four weeks, against 1 the four weeks before. 0.0% of all new papers.

  1. Curriculum proof repair with learned counterexamples

    Nov 10, 2026Yuechun Sun, Jun Yang, Kexin PeiLarge Language Model-Guided Theorem ProvingFormal Verification

  2. Counterexample-driven autonomous research with application to excess radiated energy in a Z-pinch

    Nov 1, 2026Bowen Zhu, Jian WuAutonomous Research AgentsCounterexample-Guided Refinement

  3. Secure Agentic Coding through Counterexample-Grounded Feedback

    Oct 19, 2026Tue Le, Anh Nguyen Hoang, Gabriel Sasseville +3Secure Code GenerationAgentic Code Generation

  4. Self-evolving network verifiers

    Aug 11, 2026Ioannis Protogeros, Tibor Schneider, Laurent VanbeverCounterexample-Guided RefinementFormal Verification

  5. Modal CEGAR-tableaux with RECAR and resolution-based SAT-shortcuts

    Jun 30, 2026Rajeev Goré, Cormac KikkertAutomated Theorem ProvingCounterexample-Guided Refinement

  6. Unassigned Agents in Compilation-based Multi-agent Path Finding

    Jun 14, 2026Pavel SurynekCounterexample-Guided RefinementMulti-Agent Path Finding

  7. Counterexample Guided Learning in the Large using Reasoning Agents

    Jun 9, 2026Hongyi Liu, Frederic Sala, Thomas Reps +1Counterexample-Guided RefinementLLM-Based Program Synthesis

  8. 2-ASP(Q) programs with weak constraints: Complexity and efficient implementation

    May 26, 2026Andrea Cuteri, Giuseppe Mazzotta, Francesco RiccaLogic ProgrammingCounterexample-Guided Refinement

  9. ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification

    May 26, 2026Muhammad A. A. Pirzada, Weiqi Wang, Yiannis Charalambous +2Counterexample-Guided RefinementFormal Verification

  10. Property-Guided LLM Program Synthesis for Planning

    May 15, 2026André G. Pereira, Augusto B. Corrêa, Jendrik SeippSymbolic PlanningCounterexample-Guided Refinement

  11. The Counterexample Game: Iterated Conceptual Analysis and Repair in Language Models

    May 5, 2026Daniel Drucker, Kyle MahowaldLLM Self-CorrectionLLM Evaluation

  12. SpecPylot: Python Specification Generation using Large Language Models

    Apr 17, 2026Ragib Shahariar Ayon, Shibbir AhmedCounterexample-Guided RefinementFormal Verification

  13. Let the Abyss Stare Back Adaptive Falsification for Autonomous Scientific Discovery

    Mar 30, 2026Peiran Li, Fangzhou Lin, Shuo Xing +5Autonomous Scientific DiscoveryCounterexample-Guided Refinement

  14. Failure-Driven Workflow Refinement

    Oct 11, 2025Jusheng Zhang, Kaitong Cai, Qinglin Zeng +4LLM Agent Workflow OptimizationLLM Reliability