• Open Access IconOpen Access
  • Cite Icon4
  • https://doi.org/10.1007/978-3-642-54807-9_1Copy DOI Icon

Using the SSA-Form in a Code Generator

  • Jan 1, 2014
  • Benoît Dupont De Dinechin
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In high-end compilers such as Open64, GCC or LLVM, the Static Single Assignment (SSA) form is a structural part of the target-independent program representation that supports most of the code optimizations. However, aggressive compilation also requires that optimizations that are more effective with the SSA form be applied to the target-specific program representations operated by the code generator, that is, the set of compiler phases after and including instruction selection.

Similar Papers
  • Book Chapter
  • Citations9

If-Conversion in SSA Form

  • Jan 01, 2004
  • Arthur Stoutchinin +1
  • Research Article
  • Citations132

Practical improvements to the construction and destruction of static single assignment form

  • Jul 10, 1998
  • Software: Practice and Experience
  • Preston Briggs +3
  • Research Article
  • Citations41

Algorithms for computing the static single assignment form

  • May 01, 2003
  • Journal of the ACM
  • Gianfranco Bilardi +1
  • Conference Article
  • Citations153

Array SSA form and its use in parallelization

  • Jan 01, 1998
  • Kathleen Knobe +1
  • Conference Article
  • Citations8

Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design

  • Nov 01, 2007
  • Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design
  • Philip Brisk +2
  • Conference Article
  • Citations60

Linear scan register allocation on SSA form

  • Apr 24, 2010
  • Christian Wimmer +1
  • Conference Article
  • Citations13

Verified construction of static single assignment form

  • Mar 17, 2016
  • Sebastian Buchwald +2
  • Conference Article
  • Citations8

A type system equivalent to static single assignment

  • Jul 10, 2006
  • Yutaka Matsuno +1
  • Conference Article
  • Citations13

Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design

  • Nov 05, 2007
  • Philip Brisk +2
  • Book Chapter
  • Citations18

Incremental computation of static single assignment form

  • Jan 01, 1996
  • Jong -Deok Choi +2
  • Research Article
  • Citations1

Weaving Synchronous Reactions into the Fabric of SSA-form Compilers

  • Mar 08, 2022
  • ACM Transactions on Architecture and Code Optimization
  • Hugo Pompougnac +3
  • Conference Article
  • Citations1

Recovering the Memory Behavior of Executable Programs

  • Jul 15, 2010
  • Alain Ketterlin +1
  • Research Article
  • Citations38

A Functional Perspective on SSA Optimisation Algorithms

  • Apr 01, 2004
  • Electronic Notes in Theoretical Computer Science
  • Manuel M.T Chakravarty +2
  • Book Chapter
  • Citations6

The Hot Path SSA Form: Extending the Static Single Assignment Form for Speculative Optimizations

  • Jan 01, 2010
  • Subhajit Roy +1
  • Dissertation

Address optimizations for embedded processors

  • Apr 14, 2004
  • Sai Pinnepalli
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.