Static Single-Assignment Form Seminar

27-30 April 2009, Autrans, France

About the Seminar

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.

Group Photo

Program

Introduction

• The Development of Static Single Assignment Form (40') (Slides)
  Kenneth Zadeck (NaturalBridge)
• The Landscape of SSA-based Program Representations (30') (Slides)
  Philip Brisk (EPFL)
• A metrics-based evaluation of SSA (30') (Slides)
  Jeremy Singer (University of Manchester)

Semantics, Construction, and Destruction

• A Framework for Phi-function Placement Algorithms (30') (Slides)
  Keshav Pingali (University of Texas)
• Translating Out of SSA (40') (Slides)
  Alain Darte (CNRS/ENS Lyon)
• In and Out of SSA: A Denotational Specification (30') (Slides)
  Sebastian Pop (AMD)

Programming Languages and SSA

• SSA-Based Mobile Code: Construction and Empirical Evaluation (40') (Slides)
  Wolfram Amme (Universität Jena)
• On the use of SSA with scripting languages (30') (Slides)
  Paul Biggar (Trinity College)
• SSA form and programming language design (30') (Slides)
  Anton Ertl (Vienna University of Technology)

SSA and Memory

• Array SSA Form and its Use in Program Analysis and Transformation (40') (Slides)
  Vivek Sarkar (Rice University)
• Effective Representation of Aliases and Indirect Memory Operations (30') (Slides)
  Massimiliano Mantione (Ximian)
• Efficient Alias Set Analysis Using SSA Form (30') (Slides)
  Ondrej Lhotak (University of Waterloo)
• SSA Form w.r.t. Pointer Analysis Precision (30') (Slides)
  Markus Schordan (University of Applied Sciences Technikum Wien)
• Beyond SSA: Compilers for Manycore Processors Need DSA and Some Form of Streaming SSA (15') (Slides)
  Albert Cohen (INRIA)

SSA-based Optimizations and Code Generation

• Design of an SSA Register Allocator (40') (Slides)
  Sebastian Hack (Saarland University)
• Generalized Instruction Selection using SSA Graphs (40') (Slides)
  Andreas Krall (Vienna University of Technology)
• Register Allocation by Puzzle Solving (40') (Slides)
  Jens Palsberg (UCLA)

Analyses and Optimizations

• Fast Liveness Checking under SSA (20') (Slides)
  Benoit Boissinot (ENS Lyon)
• Liveness Checking with DJ Graphs (20') (Slides)
  Dibyendu Das (IBM India)
• The Value State Dependence Graph (40') (Slides)
  Alan Mycroft (University of Cambridge)
• Code plagiarism detection on binary code (10')
  Christopher Gautier (University of Cambridge)
• Towards the Development of a VSDG compiler (10') (Slides)
  James Stanier (Sussex University)
• SSA and Constant Propagation on Predicated Code (40') (Slides)
  Jens Knoop (Vienna University of Technology)
• If-Conversion SSA Framework and Transformations (25') (Slides)
  Christian Bruel (STMicroelectronics)
• An extension to the SSA representation for predicated code (25') (Slides)
  François de-Ferrière (STMicroelectronics)

SSA-based Compilers

• Firm, a fully SSA-based IR (40') (Slides)
  Michael Beck (Universität Karlsruhe)
• Implementation Issues and Experience of SSA in GCC (40')
  Diego Novillo (Google)
• SSA Form in the Java HotSpot Client Compiler (40') (Slides)
  Christian Wimmer (UC Irvice)

Venue

• The seminar took place from 27 April 2009 to 30 April 2009


• The seminar was hold at the seminar Center l'Escandille, Autrans, France.
• Autrans is situated in the natural reserve of Vercors

Organizing Committee

Contact

Fabrice Rastello LIP ENS Lyon 46, allée d'Italie 69364 Lyon CEDEX 07 France Tel: +33 4 72 72 85 52 Fax: +33 4 72 72 80 80 Mail:

Sebastian Hack Fachrichtung 6.2 Informatik Saarland University Campus E1 3 66123 Saarbrücken Germany Tel: +49 (681) 302-57520 Fax: +49 (681) 302-3065 Mail:

---