2. A Hierarchy of Constants

  • Markus Müller-Olm
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3800)


Constant propagation aims at detecting expressions in programs that always yield a unique constant value at run-time. Replacing constant expressions by their value is one of the most widely used optimizations in practice (cf. [2, 30, 56]). Unfortunately, the constant propagation problem is undecidable even if the interpretation of branches is completely ignored, like in the common model of non-deterministic flow graphs where every program path is considered executable.


Assignment Statement Program Point Polynomial Time Reduction Polynomial Constant Linear Constant 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Markus Müller-Olm

    There are no affiliations available

    Personalised recommendations