*************************************************************************** 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 PARTICIPATION 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. PRELIMINARY PROGRAM Monday 9h-10h30: Introduction 30" + 30" + 30" * History of SSA Kenneth Zadeck (NaturalBridge) * The Landscape of SSA-based Program Representations Philip Brisk (EPFL) * A Metrics-Based Evaluation of SSA Jeremy Singer (University of Manchester) Monday 11h10-12h30: Program Representations 40" + 40" * The Value State Dependence Graph Alan Mycroft (University of Cambridge) * Predication under SSA Benoit Dupont de Dinechin (STMicroelectronics) Monday 14h-15h40: SSA Semantics, Construction, and Destruction 30" + 40" + 30" * A Framework for Phi-function Placement Algorithms Keshav Pingali (University of Texas): Seb 40 * Translating Out of SSA Alain Darte (CNRS/ENS Lyon) * In and Out of SSA: A Denotational Specification Sebastian Pop Monday 16h30-18h20: Programming Languages and SSA 40" + 40" + 30" * SSA-Based Mobile Code: Construction and Empirical Evaluation Wolfram Amme (Universität Jena) * On the Use of SSA with Scripting Languages: Seb 30 Paul Biggar * SSA Form and Programming Language Design Anton Ertl Tuesday 8h30-9h40 10h30-11h30: SSA Extensions for Memory 40" + 30" + 30" + 30" * Array SSA Vivek Sarkar * Pointer Analysis Ondrej Lhotak: Seb 40 * Effective Representation of Aliases and Indirect Memory Operations Massimiliano Mantione: Seb 40 * SSA Form w.r.t. Pointer Analysis Precision Markus Schordan: Seb 40 Wednesday 8h30-9h50 11h-12h20: Code Generation 40" + 40" + 40" + 40" * Hardware Compilation from SSA Representation Pedro Diniz (USC ISI): Seb 30 * Design of an SSA Register Allocator Sebastian Hack (Saarland University): Seb 30 * Generalized Instruction Selection using SSA Graphs Andreas Krall (Vienna University of Technology): Seb 30 * Register Allocation by Puzzle Solving Jens Palsberg (UCLA): Seb 30 Wednesday 14h-15h40 16h40-18h: Analysis and Optimizations 35" + 25" + 40" + 40" + 40" * Fast Liveness Checking under SSA Benoit Boissinot (ENS Lyon): Seb 30 * Liveness Checking with DJ Graphs Ramakrishna Udaprasta: Seb 30 * SSA and Constant Propagation on Predicated Code Jens Knoop (Vienna University of Technology): Seb 30 * Taint Analysis with SSA Chenyi Zhang: Seb 30 * Typestate Static Single Assignment form Vugranam Sreedhar: Seb 30 SSA-based Compilers 40" + 40" + 40": Thursday 9h-11h * Firm, a Fully SSA-based IR Michael Beck (Universität Karlsruhe): Seb 30 * Implementation Issues and Experience of SSA in GCC Diego Novillo (Google): Seb 30 * SSA Form in the Java HotSpot Client Compiler Christian Wimmer (UC Irvice): Seb 30 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