English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Recursive Program Optimization Through Inductive Synthesis Proof Transformation

MPS-Authors
/persons/resource/persons44961

Madden,  Peter
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44204

Bundy,  Alan
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Madden, P., Bundy, A., & Smaill, A. (1999). Recursive Program Optimization Through Inductive Synthesis Proof Transformation. Journal of Automated Reasoning, 22(1), 65-115.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-368C-A
Abstract
The research described in this paper involved developing transformation techniques which increase the efficiency of the original program, the *source*, by transforming its synthesis proof into one, the *target*, which yields a computationally more efficient algorithm. We describe a working proof transformation system which, by exploiting the duality between mathematical induction and recursion, employs the novel strategy of optimizing recursive programs by transforming inductive proofs. We compare and contrast this approach with the more traditional approaches to program transformation, and highlight the benefits of proof transformation with regards to search, correctness, automatability and generality.