JLP
2008
13 years 4 months ago
2008
We demonstrate a method for describing data-flow analyses based program optimizations as compositional type systems with a transformation component. Analysis results are presented...
CL
2000
Springer
13 years 8 months ago
2000
Springer
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...
IFL
1997
Springer
13 years 8 months ago
1997
Springer
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...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
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...
ICCAD
2004
IEEE
14 years 1 months ago
2004
IEEE
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...