Recursive Program Optimization through Inductive Synthesis Proof Transformation

Authors:
Peter Madden;Alan Bundy;Alan Smaill
Affiliations:
DERA (DERA Malvern, St Andrews Road, Malvern, Worcs. WR14 3PS, UK). e-mail: pmadden@taz.dra.hmg.uk RCMS Ltd. (Windsor House, Millbrook Way, Colnbrook, Slough SL3 0HN, UK). e-mail: pmadden@globalne ...;Department of AI, University of Edinburgh, 80 South Bridge, Edinburgh EH1 1HN, Scotland. e-mail: bundy/smaill@dai.ed.ac.uk;Department of AI, University of Edinburgh, 80 South Bridge, Edinburgh EH1 1HN, Scotland. e-mail: bundy/smaill@dai.ed.ac.uk
Venue:
Journal of Automated Reasoning
Year:
1999

Citing 10
Cited 1

Eliminating Redundant Recursive Calls.

ACM Transactions on Programming Languages and Systems (TOPLAS)
A computational logic handbook

A computational logic handbook
Experiments with proof plans for induction

Journal of Automated Reasoning
Rippling: a heuristic for guiding inductive proofs

Artificial Intelligence
A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
A Deductive Approach to Program Synthesis

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Functional Programming Environment Supporting Execution, Partial Execution and Transformation

PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume I: Parallel Architectures
Formal Methods for Automated Program Improvement

KI '94 Proceedings of the 18th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
The Oyster-Clam System

Proceedings of the 10th International Conference on Automated Deduction
A powerful strategy for deriving efficient programs by transformation

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming

Strategic Issues, Problems and Challenges in Inductive Theorem Proving

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The research described in this paper involved developing transformationtechniques that increase the efficiency of the original program, thesource, by transforming its synthesis proof into one, thetarget, which yields a computationally more efficient algorithm. Wedescribe a working proof transformation system that, by exploiting theduality between mathematical induction and recursion, employs the novelstrategy of optimizing recursive programs by transforming inductive proofs.We compare and contrast this approach with the more traditional approachesto program transformation and highlight the benefits of proof transformationwith regards to search, correctness, automatability, and generality.