Unfold/fold program transformations
Algebraic methods in semantics
A survey and classification of some program transformation approaches and techniques
The IFIP TC2/WG 2.1 Working Conference on Program specification and transformation
Abstract interpretation of declarative languages
Abstract interpretation of declarative languages
Recursive applicative program schemes
Handbook of theoretical computer science (vol. B)
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
| Hi-index | 0.00 |
Several formal approaches for the development of programs have been suggested. Among them, the transformational approach which allows to express formal developments as a linear equational proof. These developments lead to produce on the one hand the suited program satisfying its formal initial specifications and, on the other hand, the proof of correctness of this development. In most of the cases, this correctness is concerned with the only functional aspects. Operational ones are taken into account intuitively. Our paper deals with non functional correction of software. We suggest a transformational approach which allows the developer to produce cost expressions that can be interpreted in order to evaluate and get the benefit yielded by a given transformation application. These cost expressions are correctly associated to the intermediate objects of the development (abstract progrms). We present a classification of the properties which are studied during the development phase and the correct formal transformational process allowing to get a particular evaluator for each kind of non functional properties. Applications are given as well.