***************************************************************************

                       CALL FOR ABSTRACT
                    CALL FOR PARTICIPATION

           Seminar on Static Single Assignment
           Autrans, France, April 27-30, 2009

         http://www.prog.uni-saarland.de/ssasem/

       Sponsors: HiPEAC, LIP, STMicroelectronics, INRIA

***************************************************************************

CALL FOR ABSTRACT

The way how the program is represented in the compiler has large influence on
the efficiency and effectiveness of the compiler. Static Single Assignment
(SSA) form is widely used in modern compilers even at the code generation level
as it allows for simple yet efficient optimizations and analyses. Nowadays, we
see compilers emerging that are completely based on SSA. Thus, SSA will play an
even more important role in the future of compilation.

The topics of interest include, but are not limited to:

    * Static analyses on the SSA form
    * Compiler optimisations and code transformations under SSA
    * Construction/deconstruction/preservation of SSA form
    * Semantics/properties/flavours/extensions of SSA
    * Engineering aspects of SSA in compilers, binary translators, etc.
    * Applications of SSA in other areas such as program analysis, program verification, etc.

Special emphasis is put on the comparison of SSA-based techniques to their
non-SSA counterparts.

The goal of the seminar is to bring researchers and practitioners in compilers
together to exchange ideas and foster the development of SSA. Therefore, one
half of each day is dedicated to presentations and the other half for informal
discussions among the participants. 


INVITED SPEAKERS

 * History of SSA, Kenneth Zadeck (NaturalBridge)
 * SSA-Based Mobile Code: Construction and Empirical Evaluation, Wolfram Amme (Universität Jena)
 * The Landscape of SSA-based Program Representations, Philip Brisk (EPFL)
 * Predication under SSA, Benoit Dupont de Dinechin (STMicroelectronics)
 * The Value State Dependence Graph, Alan Mycroft (University of Cambridge)
 * A metrics-based evaluation of SSA, Jeremy Singer (University of Manchester)
 * Firm, a fully SSA-based IR, Michael Beck (Universität Karlsruhe)
 * Implementation Issues and Experience of SSA in GCC, Diego Novillo (Google)
 * SSA Form in the Java HotSpot Client Compiler, Christian Wimmer (UC Irvice)
 * Fast Liveness Checking under SSA, Benoit Boissinot (ENS Lyon)
 * Translating Out of SSA, Alain Darte (CNRS/ENS Lyon)
 * Hardware Compilation from SSA Representation, Pedro Diniz (USC ISI)
 * Design of an SSA Register Allocator, Sebastian Hack (Saarland University)
 * SSA and Constant Propagation on Predicated Code, Jens Knoop (Vienna University of Technology)
 * Generalized Instruction Selection using SSA Graphs, Andreas Krall (Vienna University of Technology)
 * Register Allocation by Puzzle Solving, Jens Palsberg (UCLA)
 * TBA, Vikram Adve (Urbana Champaign)
 * TBA, Keshav Pingali (Univsersity of Texas)
 ...

IMPORTANT DATES

* If you want to give a presentation, please send an abstract to either Fabrice
Rastello (fabrice.rastello@ens-lyon.fr) or Sebastian Hack (hack@cs.uni-sb.de)
before 27 February 2009

* If you want to attend, without necessarily aiming at giving a presentation, due
to limited number of places, the used algorithm is first arrived, first served.
So just confirm your attendance as soon as possible to either Fabrice Rastello
or Sebastian Hack.


ORGANIZING/PROGRAM COMMITTEE

* Christian Bertin (ST Microelectronics)
* Alain Darte (CNRS/ENS Lyon)
* Sebastian Hack (Saarland University)
* Alan Mycroft (University of Cambridge)
* Jens Palsberg (UCLA)
* Fabrice Rastello (INRIA/ENS Lyon) 

***************************************************************************
The seminar belongs to the joint program of activities of
the HiPEAC Compiler Platform Cluster:
http://http://www.hipeac.net/Compilation_platform