Saturation-Guided Inductive Synthesis
This talk overviews recent progress in automating inductive reasoning in quantified logic, with applications to code synthesis, and shows that induction and synthesis are better together in saturation, allowing not only to prove quantified properties F, but also generate a functional implementation of F during proof search 1.