Constant Propagation with Conditional Branches

@article{Wegman1985ConstantPW,
  title={Constant Propagation with Conditional Branches},
  author={Mark N. Wegman and F. Kenneth Zadeck},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1985},
  volume={13},
  pages={181-210}
}
Constant propagation is a well-known global flow analysis problem. The goal of constant propagation is to discover values that are constant on all possible executions of a program and to propagate these constant values as far forward through the program as possible. Expressions whose operands are all constants can be evaluated at compile time and the results propagated further. Using the algorithms presented in this paper can produce smaller and faster compiled programs. The same algorithms can… CONTINUE READING
Highly Influential
This paper has highly influenced 42 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 649 citations. REVIEW CITATIONS

4 Figures & Tables

Topics

Statistics

02040'88'91'94'97'00'03'06'09'12'15'18
Citations per Year

650 Citations

Semantic Scholar estimates that this publication has 650 citations based on the available data.

See our FAQ for additional information.