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
Schema-guided synthesis of imperative programs by constraint solving
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
| Hi-index | 0.00 |
An approach to automatic imperative program synthesis is presented which builds upon Gries' vision of developing a program and its proof hand in hand. To achieve this vision we rely on the proof planning paradigm, which enables the coupling of both heuristic and deductive components. By formalizing structured programming and proof heuristics within the proof planning framework we focus the search for a correct program. Encoding these heuristics within a proof plan and strengthening proof planning, by embedding it within the conventional AI planning paradigm, enables a significant degree of automation.