85 search results - page 10 / 17 » On Small Hard Leaf Languages |
OOPSLA
2005
Springer
14 years 3 months ago
2005
Springer
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
LCTRTS
2004
Springer
14 years 3 months ago
2004
Springer
Energy-aware compilers are becoming increasingly important for embedded systems due to the need to meet conflicting constraints on time, code size and power consumption. We intro...
ASPLOS
2000
ACM
14 years 2 months ago
2000
ACM
By studying the behavior of programs in the SPECint95 suite we observed that six out of eight programs exhibit a new kind of value locality, the frequent value locality, according...
ICDT
2009
ACM
14 years 10 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
POPL
2004
ACM
14 years 10 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...