Programme of CC

THURSDAY, April 1

9.00
10.00
TACAS Invited Talk
Antti Valmari (Tampere University of Technology, SF)
What the Small Rubik's Cube Taught Me on Data Structures, Information Theory and Randomisation
Session chair: Kurt Jensen
10.00
10.30
Coffee
10.30
10.40
Welcome
10.40
12.40
CC
Program Analysis

Session chair:  Josep Llosa

Analyzing memory accesses in x86 executables
Gogul Balakrishnan and Thomas Reps (University of Wisconsin, Madison, USA)

The limits of alias analysis for scalar optimizations,
Rezaul A. Chowdhury, Peter Djeu (University of Texas, Austin, USA), Brendon Cahoon (Conformative Systems, Austin, USA), James H. Burrill (University of Massachusetts, Amherst, USA), Kathryn S. McKinley (University of Texas, Austin, USA)

Pruning interference and ready dependence for slicing concurrent Java programs
Venkatesh Prasad Ranganath and John Hatcliff (Kansas State University, USA)

Data dependence profiling for speculative optimizations
Tong Chen, Jin Lin, Xiaorun Dai, Wei-Chung Hsu, Pen-Chung Yew (University of Minnesota, USA)
12.30
14.30
Lunch
14.30
15.30
CC Invited Talk
Mary Lou Soffa (University of Pittsburgh, USA)
Developing a Foundation for Code Optimization
Session chair:  Evelyn Duesterwald
15.30
16.30
CC
Parsing

Session chair:  Reinhard Wilhelm

Elkhound: a fast, practical GLR parser generator
Scott McPeak, George Necula (Berkeley, USA)

Generalised parsing: some engineering costs
Adrian Johnstone, Elizabeth Scott, and Giorgios Economopoulos (University of London, UK)
16.30
17.00
Coffee
17.00
18.30
CC
Loop Analysis

Session chair:  Paul Feautrier

An automata-theoretic algorithm for counting solutions to Presburger formulas
Erin Parker (University of North Carolina, Chapel Hill, USA), Siddhartha Chatterjee (IBM T.J.Watson Research Center, USA)

A symbolic approach to Bernstein expansion for program analysis and optimization
Irina Tchoupaeva (Universite Strasbourg, F), Philippe Clauss (INRIA Rocquencourt, F)

Periodic polyhedra
Benoît Meister (LSIIT-ICPS, Illkirch, F)
Evening eTX Reception

FRIDAY, April 2

9.00
10.00
ETAPS Invited Talk
Robin Milner (Cambridge University, UK)
A Grand Challenge: Theories for Global Ubiquitous Computing
Session chair: Fernando Orejas
10.00
10.30
Coffee
10.30
12.30
CC
Optimization

Session chair:  Ras Bodik

Region-based partial dead code elimination on predicated code
Qiong Cai, Lin Gao, Jingling Xue (University of New South Wales, Sydney, AU)

Value-based partial redundancy elimination
Thomas VanDrunen and Antony L. Hosking (Purdue University, USA)

Increasing the applicability of scalar replacement
Byoungro So (IBM T.J. Watson Research Center, USA) and Mary Hall (University of Southern California, USA)

Reducing the cost of object boxing
Tim Owen and Des Watson (University of Sussex, Brighton, UK)
12.30
14.30
Lunch
14.30
16.30
CC
Code Generation and Backend Optimizations

Session chair:  Thomas Gross

FFT compiler techniques
Stefan Kral, Franz Franchetti, Juergen Lorenz, Christoph W. Ueberhuber, and  Peter Wurzinger (Vienna University of Technology, A).

Widening integer arithmetic
Kevin Redwine and Norman Ramsey (Harvard University, USA)

Stochastic bit-width approximation using Extreme Value Theory for customizable processors
Emre Ozer, Andy P. Nisbet, David Gregg (Trinity College, Dublin, IRL)

Using multiple memory access instructions for reducing code size
Neil Johnson and Alan Mycroft (University of Cambridge, UK)
16.30
17.00
Coffee
17.00
18.30
CC
Compiler Construction

Session chair:  Gorel Hedin

Integrating the Soot compiler infrastructure into an IDE
Jennifer Lhotak, Ondrej Lhotak, and Laurie Hendren (McGill University, Montreal, CDN)

Declarative composition of stack frames
Christian Lindig (Universitaet Saarbruecken, D), Norman Ramsey (Harvard University, USA)
18.30
19.00
Closing Session
20.00 SPIN dinner