Sciweavers

CC
2006
Springer
124views System Software» more  CC 2006»
14 years 3 months ago
Polyhedral Code Generation in the Real World
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
Nicolas Vasilache, Cédric Bastoul, Albert C...
CC
2006
Springer
108views System Software» more  CC 2006»
14 years 3 months ago
Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers
This paper presents a new worklist algorithm that significantly speeds up a large class of flow-sensitive data-flow analyses, including typestate error checking and pointer analysi...
Teck Bok Tok, Samuel Z. Guyer, Calvin Lin
CC
2006
Springer
14 years 3 months ago
Interprocedural Dataflow Analysis in the Presence of Large Libraries
Interprocedural dataflow analysis has a large number of uses for software optimization, maintenance, testing, and verification. For software built with reusable components, the tra...
Atanas Rountev, Scott Kagan, Thomas J. Marlowe
CC
2006
Springer
101views System Software» more  CC 2006»
14 years 3 months ago
SARA: Combining Stack Allocation and Register Allocation
Commonly-used memory units enable a processor to load and store multiple registers in one instruction. We showed in 2003 how to extend gcc with a stack-location-allocation (SLA) ph...
V. Krishna Nandivada, Jens Palsberg
CC
2006
Springer
122views System Software» more  CC 2006»
14 years 3 months ago
Context-Sensitive Points-to Analysis: Is It Worth It?
We present the results of an empirical study evaluating the precision of subset-based points-to analysis with several variations of context sensitivity on Java benchmarks of signif...
Ondrej Lhoták, Laurie J. Hendren
CC
2006
Springer
129views System Software» more  CC 2006»
14 years 3 months ago
Loop Transformations in the Ahead-of-Time Optimization of Java Bytecode
Abstract. Loop optimizations such as loop unrolling, unfolding and invariant code motion have long been used in a wide variety of compilers to improve the running time of applicati...
Simon Hammond, David Lacey
CC
2006
Springer
132views System Software» more  CC 2006»
14 years 3 months ago
Register Allocation for Programs in SSA-Form
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation...
Sebastian Hack, Daniel Grund, Gerhard Goos
CC
2006
Springer
124views System Software» more  CC 2006»
14 years 3 months ago
Hybrid Optimizations: Which Optimization Algorithm to Use?
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
John Cavazos, J. Eliot B. Moss, Michael F. P. O'Bo...
CC
2006
Springer
182views System Software» more  CC 2006»
14 years 3 months ago
Selective Runtime Memory Disambiguation in a Dynamic Binary Translator
Abstract. Alias analysis, traditionally performed statically, is unsuited for a dynamic binary translator (DBT) due to incomplete control-flow information and the high complexity o...
Bolei Guo, Youfeng Wu, Cheng Wang, Matthew J. Brid...
CC
2006
Springer
122views System Software» more  CC 2006»
14 years 3 months ago
Accurately Choosing Execution Runs for Software Fault Localization
Software fault localization involves locating the exact cause of error for a "failing" execution run
Liang Guo, Abhik Roychoudhury, Tao Wang