CC 2009
International Conference on Compiler Construction

22-29 March 2009, York, United Kingdom


Call for Papers
Important Dates
Invited Speaker
Conference Programme
Programme Committee
ETAPS 2009


Conference Description

CC is a member conference of the European Joint Conferences on Theory and Practice of Software (ETAPS), which is the primary European forum for academic and industrial researchers working on topics relating to Software Science. ETAPS 2009 is the 12th joint conference in this series.

The prior conferences have been ETAPS 1998 in Lisbon, ETAPS 1999 in Amsterdam, ETAPS 2000 in Berlin, ETAPS 2001 in Genova, ETAPS 2002 in Grenoble, ETAPS 2003 in Warsaw, ETAPS 2004 in Barcelona, ETAPS 2005 in Edinburgh, ETAPS 2006 in Vienna, ETAPS 2007 in Braga, and ETAPS 2008 in Budapest.


Call for Papers

CC is interested in work on processing programs in the most general sense: analyzing, transforming or executing input that describes how a system operates, including traditional compiler construction as a special case.

Topics of interest include, but are not limited to:

  • compilation and interpretation techniques, including program representation and analysis, code generation and code optimization;
  • run-time techniques, including memory management and dynamic and just-in-time compilation;
  • programming tools, from refactoring editors to checkers to compilers to virtual machines to debuggers;
  • techniques for specific domains, such as secure, parallel, distributed, embedded or mobile environments;
  • design of novel language constructs and their implementation.
Accepted paper wil appear in the proceedings and have presentations during the conference. A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden.


Submission Guidelines

Papers should be submitted electronically in PDF format. The proceedings will be published in the Springer-Verlag Lecture Notes in Computer Science series. Final papers will be in the format specified by Springer-Verlag at the URL:

It is strongly recommended that submissions adhere to the specified format (LNCS) and to the limit of 15 pages. Submissions that are clearly too long may be rejected immediately. No appendices are allowed.

Papers can be sumitted via the following submission page.


Important Dates

Submission deadlines are strict (site will close at 23:59 Samoan time). Submission of an abstract implies no obligation to submit a full version; abstracts with no corresponding full versions by the full paper deadline will be considered as withdrawn.


Invited Speaker

Vivek Sarkar, Rice University


Conference Programme

  • Monday 9:00-9:30: Opening
  • Monday 9:30-10:30: Invited Talk
    Vivek Sarkar: Challenges in Code Optimization of Parallel Programs
  • Monday 11:00-12:30: Formal Properties of Optimizations
    Magnus O. Myreen, Konrad Slind, Mike Gordon: Extensible Proof-Producing Compilation
    Richard Warburton, Sara Kalvala: An Architecture for Safe Optimisation of Java Bytecode
    Min Zhao, Bruce Childers, Mary Lou Soffa: A Framework for Exploring Optimization Properties
  • Monday 14:30-16:30: Concurrency and Distributed Systems
    Nalini Vasudevan, Olivier Tardieu, Julian Dolby, Stephen A. Edwards: Compile-Time Analysis and Specialization of Clocks in Concurrent Programs
    Martin Abadi, Andrew Birrell, Tim Harris, Johnson Hsieh, Michael Isard: Implementation and Use of Transactional Memory with Dynamic Separation
    Lin Gao, Lian Li, Jingling Xue, Tin-Fook Ngai: Exploiting Speculative TLP in Recursive Programs by Dynamic Thread Prediction
    Darren Dao, Jeannie Albrecht, Charles Killian, Amin Vahdat: Live Debugging of Distributed Systems
  • Monday 17:00-18:30: Frontend Technology
    Yoann Padioleau: Parsing C/C++ Code without Preprocessing
    Giorgios Economopoulos, Paul Klint, Jurgen Vinju: Faster Scannerless GLR Parsing
    Lennart C. L. Kats, Tony Sloane, Eelco Visser: Decorated Attribute Grammars - Attribute Evaluation meets Strategic Programming
  • Tuesday 10:30-12:30: Register Allocation and Instruction Scheduling
    Fernando Pereira, Jens Palsberg: SSA Elimination after Register Allocation
    Matthias Braun, Sebastian Hack: Register Spilling and Live-Range Splitting for SSA-Form Programs
    Muhammad Umar Farooq, Lizy John: Enhanced Hierarchical Instruction Scheduling For Tiled Dataflow Architectures
    Samah Abu-Mahmeed, Zoran Budimlic, Cheryl McCosh, Ken Kennedy, Kaushik Ravindran, Jacob Kornerup, Kevin Hogan, Steve Rogers: Scheduling Tasks to Maximize Usage of Aggregate Variables In Place
  • Tuesday 14:30-16:30: Specialization
    Simone Campanoni, Martino Sykora, Giovanni Agosta, Stefano Crespi Reghizzi: Dynamic Look Ahead Compilation
    Armin Grosslinger: Precise Management of Scratchpad Memories for Localising Array Accesses in Scientific Codes
    Dan Knights, Todd Mytkowicz, Peter Sweeney, Michael Mozer, Amer Diwan: Blind Optimizations for Exploiting Hardware Features
    Annette Bieniusa, Peter Thiemann: How to CPS Transform a Monad


Programme Committee