The CC program committee is pleased to present this volume with the p- ceedings of the 13th International Conference on Compiler Construction (CC 2004). CC continues to provide an exciting forum for researchers, educators, and practitioners to exchange ideas on the latest developments in compiler te- nology, programming language implementation, and language design. The c- ference emphasizes practical and experimental work and invites contributions on methods and tools for all aspects of compiler technology and all language paradigms. This volume serves as the permanent record of the 19 papers accepted for presentation at CC 2004 held in Barcelona, Spain, during April 1–2, 2004. The 19 papers in this volume were selected from 58 submissions. Each paper was assigned to three committee members for review. The program committee met for one day in December 2003 to discuss the papers and the reviews. By the end of the meeting, a consensus emerged to accept the 19 papers presented in this volume. However, there were many other quality submissions that could not be accommodated in the program; hopefully they will be published elsewhere. ThecontinuedsuccessoftheCCconferenceserieswouldnotbepossiblewi- out the help of the CC community. I would like to gratefully acknowledge and thank all of the authors who submitted papers and the many external reviewers who wrote reviews.
Author(s): Mary Lou Soffa (auth.), Evelyn Duesterwald (eds.)
Series: Lecture Notes in Computer Science 2985
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2004
Language: English
Pages: 313
City: Berlin; New York
Tags: Programming Languages, Compilers, Interpreters; Software Engineering; Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Artificial Intelligence (incl. Robotics)
Front Matter....Pages -
Developing a Foundation for Code Optimization....Pages 1-4
Analyzing Memory Accesses in x86 Executables....Pages 5-23
The Limits of Alias Analysis for Scalar Optimizations....Pages 24-38
Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs....Pages 39-56
Data Dependence Profiling for Speculative Optimizations....Pages 57-72
Elkhound: A Fast, Practical GLR Parser Generator....Pages 73-88
Generalised Parsing: Some Costs....Pages 89-103
An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas....Pages 104-119
A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization....Pages 120-133
Periodic Polyhedra....Pages 134-149
Region-Based Partial Dead Code Elimination on Predicated Code....Pages 150-166
Value-Based Partial Redundancy Elimination....Pages 167-184
Increasing the Applicability of Scalar Replacement....Pages 185-201
Reducing the Cost of Object Boxing....Pages 202-216
FFT Compiler Techniques....Pages 217-231
Widening Integer Arithmetic....Pages 232-249
Stochastic Bit-Width Approximation Using Extreme Value Theory for Customizable Processors....Pages 250-264
Using Multiple Memory Access Instructions for Reducing Code Size....Pages 265-280
Integrating the Soot Compiler Infrastructure into an IDE....Pages 281-297
Declarative Composition of Stack Frames....Pages 298-312
Back Matter....Pages -
