Sciweavers

CC
2004
Springer
134views System Software» more  CC 2004»
14 years 3 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
114views System Software» more  CC 2004»
14 years 3 months ago
Integrating the Soot Compiler Infrastructure into an IDE
This paper presents the integration of Soot, a byte-code analysis and transformation framework, with an integrated development environment (IDE), Eclipse. Such an integrated toolki...
Jennifer Lhoták, Ondrej Lhoták, Laur...
CC
2004
Springer
177views System Software» more  CC 2004»
14 years 5 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
110views System Software» more  CC 2004»
14 years 5 months ago
Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs
In this paper, we show how previous work on escape analysis can be adapted and extended to yield a static analysis that is efficient yet effective for reducing the number of inter...
Venkatesh Prasad Ranganath, John Hatcliff
CC
2004
Springer
122views System Software» more  CC 2004»
14 years 5 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
115views System Software» more  CC 2004»
14 years 5 months ago
Periodic Polyhedra
This paper presents a new method for computing the integer hull of a parameterized rational polyhedron by introducing the concept of periodic polyhedron. Besides concerning general...
Benoît Meister
CC
2004
Springer
160views System Software» more  CC 2004»
14 years 5 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
163views System Software» more  CC 2004»
14 years 5 months ago
Declarative Composition of Stack Frames
When a compiler translates a procedure, it must lay out the procedure’s stack frame in a way that respects the calling convention. Many compilers respect the convention either by...
Christian Lindig, Norman Ramsey
CC
2004
Springer
132views System Software» more  CC 2004»
14 years 5 months ago
FFT Compiler Techniques
Stefan Kral, Franz Franchetti, Juergen Lorenz, Chr...
CC
2004
Springer
142views System Software» more  CC 2004»
14 years 5 months ago
A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization
Abstract. Several mathematical frameworks for static analysis of programs have been developed in the past decades. Although these tools are quite useful, they have still many limit...
Philippe Clauss, Irina Tchoupaeva