CC
13 years 10 months ago
2004 Springer
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic fin...
CC
13 years 9 months ago
2004 Springer
Abstract. Some codes require computations to use fewer bits of precision than are normal for the target machine. For example, Java requires 32-bit arithmetic even on a 64-bit targe...
CC
13 years 10 months ago
2004 Springer
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
CC
13 years 10 months ago
2004 Springer
The Generalized LR (GLR) parsing algorithm is attractive for use in parsing programming languages because it is asymptotically efficient for typical grammars, and can parse with an...
CC
13 years 10 months ago
2004 Springer
Although optimization technology has been successful over the past 40 years, recent trends are emerging that demand we reconsider the paradigm that we are using for code optimizati...
|