UID:
almahu_9947920572902882
Format:
313 p.
,
online resource.
ISBN:
9783540247234
Series Statement:
Lecture Notes in Computer Science, 2985
Content:
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.
Note:
Invited Talk -- Developing a Foundation for Code Optimization -- Program Analysis -- Analyzing Memory Accesses in x86 Executables -- The Limits of Alias Analysis for Scalar Optimizations -- Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs -- Data Dependence Profiling for Speculative Optimizations -- Parsing -- Elkhound: A Fast, Practical GLR Parser Generator -- Generalised Parsing: Some Costs -- Loop Analysis -- An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas -- A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization -- Periodic Polyhedra -- Optimization -- Region-Based Partial Dead Code Elimination on Predicated Code -- Value-Based Partial Redundancy Elimination -- Increasing the Applicability of Scalar Replacement -- Reducing the Cost of Object Boxing -- Code Generation and Backend Optimizations -- FFT Compiler Techniques -- Widening Integer Arithmetic -- Stochastic Bit-Width Approximation Using Extreme Value Theory for Customizable Processors -- Using Multiple Memory Access Instructions for Reducing Code Size -- Compiler Construction -- Integrating the Soot Compiler Infrastructure into an IDE -- Declarative Composition of Stack Frames.
In:
Springer eBooks
Additional Edition:
Printed edition: ISBN 9783540212973
Language:
English
Subjects:
Computer Science
URL:
http://dx.doi.org/10.1007/b95956
URL:
Volltext
(lizenzpflichtig)
