CC 2004

20 papers

1. A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization · Philippe Clauss, Irina Tchoupaeva
2. An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas · Erin Parker, Siddhartha Chatterjee
3. Analyzing Memory Accesses in x86 Executables · Gogul Balakrishnan, Thomas W. Reps
4. Data Dependence Profiling for Speculative Optimizations · Tong Chen, Jin Lin, Xiaoru Dai, Wei-Chung Hsu, Pen-Chung Yew
5. Declarative Composition of Stack Frames · Christian Lindig, Norman Ramsey
6. Developing a Foundation for Code Optimization · Mary Lou Soffa
7. Elkhound: A Fast, Practical GLR Parser Generator · Scott McPeak, George C. Necula
8. FFT Compiler Techniques · Stefan Kral, Franz Franchetti, Juergen Lorenz, Christoph W. Ueberhuber, Peter Wurzinger
9. Generalised Parsing: Some Costs · Adrian Johnstone, Elizabeth Scott, Giorgios Economopoulos
10. Increasing the Applicability of Scalar Replacement · Byoungro So, Mary W. Hall
11. Integrating the Soot Compiler Infrastructure into an IDE · Jennifer Lhoták, Ondrej Lhoták, Laurie J. Hendren
12. Periodic Polyhedra · Benoît Meister
13. Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs · Venkatesh Prasad Ranganath, John Hatcliff
14. Reducing the Cost of Object Boxing · Tim Owen, Des Watson
15. Region-Based Partial Dead Code Elimination on Predicated Code · Qiong Cai, Lin Gao, Jingling Xue
16. Stochastic Bit-Width Approximation Using Extreme Value Theory for Customizable Processors · Emre Özer, Andy Nisbet, David Gregg
17. The Limits of Alias Analysis for Scalar Optimizations · Rezaul Alam Chowdhury, Peter Djeu, Brendon Cahoon, James H. Burrill, Kathryn S. McKinley
18. Using Multiple Memory Access Instructions for Reducing Code Size · Neil Johnson, Alan Mycroft
19. Value-Based Partial Redundancy Elimination · Thomas VanDrunen, Antony L. Hosking
20. Widening Integer Arithmetic · Kevin Redwine, Norman Ramsey