Are There Good Mistakes? A Theoretical Analysis of CEGIS
Susmit Jha (Strategic CAD Labs, Intel), Sanjit A. Seshia (EECS, UC, Berkeley)

TL;DR
This paper provides a theoretical analysis of CEGIS, exploring how different types of counterexamples, like minimal and history-bounded, affect the synthesis power and success of program synthesis.
Contribution
It introduces a formal comparison of CEGIS variants using minimal and history-bounded counterexamples, revealing their relative synthesis powers.
Findings
MinCEGIS has the same synthesis power as CEGIS.
HCEGIS has different power than CEGIS, with no dominance.
Counterexample type influences synthesis success in infinite candidate spaces.
Abstract
Counterexample-guided inductive synthesis CEGIS is used to synthesize programs from a candidate space of programs. The technique is guaranteed to terminate and synthesize the correct program if the space of candidate programs is finite. But the technique may or may not terminate with the correct program if the candidate space of programs is infinite. In this paper, we perform a theoretical analysis of counterexample-guided inductive synthesis technique. We investigate whether the set of candidate spaces for which the correct program can be synthesized using CEGIS depends on the counterexamples used in inductive synthesis, that is, whether there are good mistakes which would increase the synthesis power. We investigate whether the use of minimal counterexamples instead of arbitrary counterexamples expands the set of candidate spaces of programs for which inductive synthesis can…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
