Sciweavers

TRIER
2002
13 years 6 months ago
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Markus Müller-Olm, Helmut Seidl
FPGA
1997
ACM
118views FPGA» more  FPGA 1997»
13 years 11 months ago
Improving Functional Density Through Run-Time Constant Propagation
Circuit specialization techniques such as constant propagation are commonly used to reduce both the hardware resources and cycle time of digital circuits. When recon gurable FPGAs...
Michael J. Wirthlin, Brad L. Hutchings
ESOP
2001
Springer
13 years 11 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing