• Home
  • Search
  • Algorithms for computing the static single assignment form
  • Cite Icon41
  • https://doi.org/10.1145/765568.765573Copy DOI Icon

Algorithms for computing the static single assignment form

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The Static Single Assignment (SSA) form is a program representation used in many optimizing compilers. The key step in converting a program to SSA form is called ϕ-placement. Many algorithms for ϕ-placement have been proposed in the literature, but the relationships between these algorithms are not well understood.In this article, we propose a framework within which we systematically derive (i) properties of the SSA form and (ii) ϕ-placement algorithms. This framework is based on a new relation called merge which captures succinctly the structure of a program's control flow graph that is relevant to its SSA form. The ϕ-placement algorithms we derive include most of the ones described in the literature, as well as several new ones. We also evaluate experimentally the performance of some of these algorithms on the SPEC92 benchmarks.Some of the algorithms described here are optimal for a single variable. However, their repeated application is not necessarily optimal for multiple variables. We conclude the article by describing such an optimal algorithm, based on the transitive reduction of the merge relation, for multi-variable ϕ-placement in structured programs. The problem for general programs remains open.

Similar Papers
  • 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
  • Book Chapter
  • Citations9

If-Conversion in SSA Form

  • Jan 01, 2004
  • Arthur Stoutchinin +1
  • Conference Article
  • Citations13

Verified construction of static single assignment form

  • Mar 17, 2016
  • Sebastian Buchwald +2
  • 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
  • Book Chapter
  • Citations18

Incremental computation of static single assignment form

  • Jan 01, 1996
  • Jong -Deok Choi +2
  • Conference Article
  • Citations13

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

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

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

  • Jan 01, 2010
  • Subhajit Roy +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
  • Conference Article
  • Citations8

A type system equivalent to static single assignment

  • Jul 10, 2006
  • Yutaka Matsuno +1
  • Book Chapter
  • Citations4

Using the SSA-Form in a Code Generator

  • Jan 01, 2014
  • Benoît Dupont De Dinechin
  • Conference Article
  • Citations7

Interference graphs for procedures in static single information form are interval graphs

  • Jan 01, 2007
  • Philip Brisk +1
  • Conference Article
  • Citations1

Recovering the Memory Behavior of Executable Programs

  • Jul 15, 2010
  • Alain Ketterlin +1
  • 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
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.