Sciweavers

1552 search results - page 1 / 311
» On the Complexity of Constant Propagation
Sort
View
ESOP
2001
Springer
13 years 10 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
ESOP
2008
Springer
13 years 7 months ago
Upper Adjoints for Fast Inter-procedural Variable Equalities
We present a polynomial-time algorithm which at the extra cost of a factor O(k) (k the number of variables) generalizes inter-procedural copy constant propagation. Our algorithm in...
Markus Müller-Olm, Helmut Seidl
PLDI
1995
ACM
13 years 9 months ago
Flow-Sensitive Interprocedural Constant Propagation
We present a flow-sensitive interprocedural constant propagation algorithm, which sttpports recursion while only performing one flow-sensitive analysis of each procedure. We prese...
Paul R. Carini, Michael Hind
TRIER
2002
13 years 5 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
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 5 months ago
New Constant-Weight Codes from Propagation Rules
This paper proposes some simple propagation rules which give rise to new binary constant-weight codes.
Yeow Meng Chee, Chaoping Xing, Sze Ling Yeo