Predicate Synthesis for Correcting Faulty Conjectures: The Proof Planning Paradigm
Automated Software Engineering
Higher Order Function Synthesis Through Proof Planning
Proceedings of the 16th IEEE international conference on Automated software engineering
Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis
Automated Software Engineering
Dynamic rippling, middle-out reasoning and lemma discovery
Verification, induction termination analysis
Dynamic rippling, middle-out reasoning and lemma discovery
Verification, induction termination analysis
Automating Inductive Specification Proofs
Fundamenta Informaticae
| Hi-index | 0.00 |
We describe a proof plan that characterises a family of proofs corresponding to the synthesis of recursive functional programs. This plan provides a significant degree of automation in the construction of recursive programs from specifications, together with correctness proofs. This plan makes use of meta-variables to allow successive refinement of the identity of unknowns, and so allows the program and the proof to be developed hand in hand. We illustrate the plan with parts of a substantial example-the synthesis of a unification algorithm.