Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

30 relations
Aliasing (computing)Common subexpression eliminationCompile timeCompiler

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
One compiler: deoptimization to optimized code
A multi-tier virtual machine (VM) deoptimizes and transfers last-tier execution to the first-tier execution when a speculative… 
2017
2017
Bistable reaction equations with doubly nonlinear diffusion
Reaction-diffusion equations appear in biology and chemistry, and combine linear diffusion with different kind of reaction terms… 
2014
2014
Bit-Vector Rewriting with Automatic Rule Generation
Rewriting is essential for efficient bit-vector SMT solving. The rewriting algorithm commonly used by modern SMT solvers… 
2011
2011
Characteristics of the partially coherent Gaussian Schell-model beam propagating in atmospheric turbulence
Based on the extended Huygens-Fresnel principle, the expressions for effective beam parameter, beam size, angle spread, the… 
2009
2009
Semi-automatic Segmentation of MRI Brain Tumor
Segmentation of images holds an important position in the area of image processing. It becomes more important while typically… 
2001
2001
Fast Machine-Adaptable Dynamic Binary Translation
Binary translation is the process of translating machine code from one instruction set architecture to another. It can be done… 
Highly Cited
1999
Highly Cited
1999
Instruction pre-processing in trace processors
In trace processors, a sequential program is partitioned at run time into "traces". A trace is an encapsulation of a dynamic… 
1999
1999
Fine-tuning of boolean formulae preprocessing techniques
This paper presents constant propagation and com mon factors rewriting methods for boolean formula preprocessing. Formula… 
1986
1986
On mixed computation: informal account of the strict and polyvariant computational schemes
Mixed computation [2,4] is a rather general concept embracing quite many notions and techniques in programming that appeared and… 
1981
1981
Program refinement by transformation
Program maintenance is simplified when the program to be modified can be viewed as an abstract algorithm to which clearly… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)