Abstract
Constant propagation is one of the most widely used optimizations in practice (cf. [2, 30, 56]). Its goal is to replace expressions that always yield a unique constant value at run-time by this value. This transformation can both speed up execution and reduce code size by replacing a computation or memory access by a load-constant instruction. Often constant propagation enables powerful further program transformations. An example is branch elimination: if the condition guarding a branch of a conditional can be identified as being constantly false, the whole code in this branch is dynamically unreachable and can be removed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Müller-Olm, M. (2006). 1. Introduction. In: Variations on Constants. Lecture Notes in Computer Science, vol 3800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11871743_1
Download citation
DOI: https://doi.org/10.1007/11871743_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45385-7
Online ISBN: 978-3-540-45386-4
eBook Packages: Computer ScienceComputer Science (R0)