Sciweavers

JLP
2008
129views more  JLP 2008»
13 years 11 months ago
Program and proof optimizations with type systems
We demonstrate a method for describing data-flow analyses based program optimizations as compositional type systems with a transformation component. Analysis results are presented...
Ando Saabas, Tarmo Uustalu
CL
2000
Springer
14 years 2 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»
14 years 3 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
SARA
2009
Springer
14 years 5 months ago
Automatically Enhancing Constraint Model Instances during Tailoring
Tailoring solver-independent constraint instances to target solvers is an important component of automated constraint modelling. We augment the tailoring process by a set of enhan...
Andrea Rendl, Ian Miguel, Ian P. Gent, Christopher...
ICCAD
2004
IEEE
121views Hardware» more  ICCAD 2004»
14 years 7 months ago
Factoring and eliminating common subexpressions in polynomial expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
Anup Hosangadi, Farzan Fallah, Ryan Kastner