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
17 papers3 papers in the last four weeks, against 1 the four weeks before. 0.0% of all new papers.