Sciweavers

CC
2004
Springer
122views System Software» more  CC 2004»
13 years 10 months ago
An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas
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...
Erin Parker, Siddhartha Chatterjee
CC
2004
Springer
134views System Software» more  CC 2004»
13 years 9 months ago
Widening Integer Arithmetic
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...
Kevin Redwine, Norman Ramsey
CC
2004
Springer
177views System Software» more  CC 2004»
13 years 10 months ago
Value-Based Partial Redundancy Elimination
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) ...
Thomas VanDrunen, Antony L. Hosking
CC
2004
Springer
160views System Software» more  CC 2004»
13 years 10 months ago
Elkhound: A Fast, Practical GLR Parser Generator
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...
Scott McPeak, George C. Necula
CC
2004
Springer
13 years 10 months ago
Developing a Foundation for Code Optimization
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...
Mary Lou Soffa
System Software
Top of PageReset Settings