Sciweavers

175 search results - page 1 / 35
» Common Subexpression Induction
Sort
View
CL
2000
Springer
13 years 8 months ago
Certification of Compiler Optimizations Using Kleene Algebra with Tests
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...
Dexter Kozen, Maria-Christina Patron
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
13 years 9 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
DATE
2009
IEEE
112views Hardware» more  DATE 2009»
14 years 11 hour ago
Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis
: Common sub-expression elimination (CSE) serves as a useful optimization technique in the synthesis of arithmetic datapaths described at RTL. However, CSE has a limited potential ...
Sivaram Gopalakrishnan, Priyank Kalla
CP
2008
Springer
13 years 7 months ago
Exploiting Common Subexpressions in Numerical CSPs
It is acknowledged that the symbolic form of the equations is crucial for interval-based solving techniques to efficiently handle systems of equations over the reals. However, only...
Ignacio Araya, Bertrand Neveu, Gilles Trombettoni