9,119 research outputs found
Recursive Program Optimization Through Inductive Synthesis Proof Transformation
The research described in this paper involved developing transformation techniques which increase the efficiency of the noriginal 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
Assembling the Proofs of Ordered Model Transformations
In model-driven development, an ordered model transformation is a nested set
of transformations between source and target classes, in which each
transformation is governed by its own pre and post- conditions, but
structurally dependent on its parent. Following the
proofs-as-model-transformations approach, in this paper we consider a
formalisation in Constructive Type Theory of the concepts of model and model
transformation, and show how the correctness proofs of potentially large
ordered model transformations can be systematically assembled from the proofs
of the specifications of their parts, making them easier to derive.Comment: In Proceedings FESCA 2013, arXiv:1302.478
- ā¦