Abstract. We describe how to implement strength reduction, loop-invariant code motion and loop quasi-invariant code motion by specializing instrumented interpreters. To curb code duplication intrinsic to such specialization, we introduce a new program transformation, rewinding, which uses Moore-automata minimization to remove duplicated code
We propose an approach and a subsequent extension for reversing imperative programs. Firstly, we pro...
We introduce an approach to performing reversible executions of programs written in an imperative co...
Abstract—Automatic code transformation in which transfor-mations are tuned for specific applications...
We implement strength reduction and loop-invariant code motion by specializing instrumented interpre...
We implement strength reduction and loop-invariant code motion by specializing instrumented interpre...
An interpreter can be viewed as performing two tasks: parsing and execution. Interpreters are specia...
This paper describes methods and procedures used for code analysis and transformation. It contains b...
Loops in programs are the source of many optimizations for improv-ing program performance, particula...
Reduction in strength is a traditional transformation for speeding up loop execution on sequential p...
Code optimization or code transformation is a complex function of a compiler involving analyses and ...
Rewrite rules with side conditions can elegantly express many classical compiler optimizations for i...
Refinements are model transformations that leave large parts of the source models unchanged. Therefo...
We wish to extend the effectiveness of loop-restructuring compilers by improving the robustness of l...
Program specialization is a collection of program transformation techniques for improving program ef...
An approach based on source-to-source compilation is presented for efficiently realizing reversibil...
We propose an approach and a subsequent extension for reversing imperative programs. Firstly, we pro...
We introduce an approach to performing reversible executions of programs written in an imperative co...
Abstract—Automatic code transformation in which transfor-mations are tuned for specific applications...
We implement strength reduction and loop-invariant code motion by specializing instrumented interpre...
We implement strength reduction and loop-invariant code motion by specializing instrumented interpre...
An interpreter can be viewed as performing two tasks: parsing and execution. Interpreters are specia...
This paper describes methods and procedures used for code analysis and transformation. It contains b...
Loops in programs are the source of many optimizations for improv-ing program performance, particula...
Reduction in strength is a traditional transformation for speeding up loop execution on sequential p...
Code optimization or code transformation is a complex function of a compiler involving analyses and ...
Rewrite rules with side conditions can elegantly express many classical compiler optimizations for i...
Refinements are model transformations that leave large parts of the source models unchanged. Therefo...
We wish to extend the effectiveness of loop-restructuring compilers by improving the robustness of l...
Program specialization is a collection of program transformation techniques for improving program ef...
An approach based on source-to-source compilation is presented for efficiently realizing reversibil...
We propose an approach and a subsequent extension for reversing imperative programs. Firstly, we pro...
We introduce an approach to performing reversible executions of programs written in an imperative co...
Abstract—Automatic code transformation in which transfor-mations are tuned for specific applications...