article · 2004
Imperative program optimization by partial evaluation
Cited by 9Abstract and details only
Abstract
We implement strength reduction and loop-invariant code motion by specializing instrumented interpreters; we define a novel program transformation that uses bisimulation to identify and remove code duplication in residual programs; and we discover that some simple classical optimizations, notably constant-propagation, seemingly do not lend themselves to implementation by specialization of instrumented interpreters.
Cite this paper
Debois, S. (2004). Imperative program optimization by partial evaluation. https://doi.org/10.1145/1014007.1014019
Debois, Søren. “Imperative program optimization by partial evaluation.” 2004, pp. 113–22, https://doi.org/10.1145/1014007.1014019.
Debois, Søren. 2004. “Imperative program optimization by partial evaluation.” https://doi.org/10.1145/1014007.1014019.
Debois, S. (2004) ‘Imperative program optimization by partial evaluation’. Available at: https://doi.org/10.1145/1014007.1014019.
@article{debois2004imperative,
title = {{Imperative program optimization by partial evaluation}},
author = {Debois, Søren},
pages = {113--122},
year = {2004},
doi = {10.1145/1014007.1014019}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.