Constant folding

Known as: Constant propagation 
Constant folding and constant propagation are related compiler optimizations used by many modern compilers. An advanced form of constant propagation… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1973-2018
051019732018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2003
2003
Constant folding is a well-known optimization of compilers which evaluates constant expressions already at compile time. Constant… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
During the past two decades many different pointer analysis algorithms have been published. Although some descriptions include… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in polynomial time by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 5.2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper concerns inter-procedural dataflow-analysis problems in which the dataflow information at a program point is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Modern optimizing compilers use several passes over a program's intermediate representation to generate good code. Many of these… (More)
Is this relevant?
1992
1992
This paper presents a connectionist uniication strategy for a Prolog-system. The uniication strategy utilizes a backprop-net (bp… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
In this paper, we present an algorithm that constructs sparse evaluation graphs for forward or backward monotone data flow… (More)
  • figure 1
  • figure 2
  • figure 4
  • table 1
  • figure 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
High-level languages could be optimized significantly if compilers could determine automatically how pointers and heap allocated… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 7
  • figure 11
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Constant propagation is a well-known global flow analysis problem. The goal of constant propagation is to discover values that… (More)
  • figure 1
  • figure 5
  • figure 8
  • figure 12
Is this relevant?
Highly Cited
1978
Highly Cited
1978
This work was supported by C.N.R.S. under grant ATP-Informatique 03119. A certain number of classical data flow analysis… (More)
Is this relevant?