Topic
Program transformation
About: Program transformation is a research topic. Over the lifetime, 2468 publications have been published within this topic receiving 73415 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: This work presents a method for verifying properties of imperative programs by using techniques based on the specialization of constraint logic programs (CLP), and improves the precision of program verification with respect to state-of-the-art software model checkers.
45 citations
TL;DR: A fully automatic top-down approach to program development in which formal problem specifications are mechanically translated into efficient RAM code is illustrated, which is guaranteed to be totally correct and an upper bound on its worst case asymptotic running time is automatically determined.
44 citations
03 Oct 2002
TL;DR: An algorithm for side-effect removal is introduced which splits the side-effects into their pure expression meaning and their state-changing meaning, which creates a program which is semantically equivalent to the original but guaranteed to be free from side- effects.
Abstract: Side-effects are widely believed to impede program comprehension and have a detrimental effect upon software maintenance. This paper introduces an algorithm for side-effect removal which splits the side-effects into their pure expression meaning and their state-changing meaning. Symbolic execution is used to determine the expression meaning, while transformation is used to place the state-changing part in a suitable location in a transformed version of the program. This creates a program which is semantically equivalent to the original but guaranteed to be free from side-effects. The paper also reports the results of an empirical study which demonstrates that the application of the algorithm causes a significant improvement in program comprehension.
44 citations
TL;DR: A program transformation technique for programs in a general stream language L whereby a data-driven evaluation of the transformed program performs exactly the same computation as a demand-driven Evaluation of the original program.
Abstract: We describe a program transformation technique for programs in a general stream language L whereby a data-driven evaluation of the transformed program performs exactly the same computation as a demand-driven evaluation of the original program. The transformational technique suggests a simple denotational characterization of demand-driven evaluation.
44 citations
18 Oct 1981
TL;DR: This paper examines how list operators can be used to guide the transformation process, and describes a small set of list operators that possess a “complete” set of transformation rules, allowing transformations to be performed very efficiently.
Abstract: An important feature of the applicative style is the use of operators that package common patterns of computation. For example, the list operator map applies a function to every element of a list. Practical use of this style has been hampered by the fact that it can be very inefficient to execute. One remedy for this situation is to use source-to-source program transformation to convert applicative style programs to more efficient equivalents. This paper examines how list operators can be used to guide the transformation process. It describes a small set of list operators that possess a “complete” set of transformation rules, allowing transformations to be performed very efficiently. Whereas most previous transformation methods resemble proofs, this transformation method resembles algebraic manipulation.
44 citations