Recursive program optimization through inductive synthesis proof transformation

DOI10.1023/A:1005969312327MaRDI QIDQ1285864zbMATH OpenFDO

Authors Alan Bundy, Alan Smaill, Peter E. Madden

Publication date 2 May 1999

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1005969312327

zbMATH Keywords

proof transformationsynthesis proofs

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• scientific article; zbMATH DE number 4164183
• Synthesis of recursive ADT transformations from reusable templates
• Proving the correctness of recursion-based automatic program transformations
• Representing proof transformations for program optimization
• Program transformation system based on generalized partial computation

Cited in

(3)

• Fast narrowing-driven partial evaluation for inductively sequential programs
• scientific article; zbMATH DE number 4164183 (Why is no real title available?)
• Proving the correctness of recursion-based automatic program transformations

This page was built for publication: Recursive program optimization through inductive synthesis proof transformation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1285864)