• Cite Icon17
  • https://doi.org/10.1145/173262.155098Copy DOI Icon

Dependence-based program analysis

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

Program analysis and optimization can be speeded up through the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and static single assignment (SSA) form. In this paper, we give a simple graph-theoretic description of the DFG and show how the DFG for a program can be constructed in O(EV) time. We then show how forward and backward dataflow analyses can be performed efficiently on the DFG, using constant propagation and elimination of partial redundancies as examples. These analyses can be framed as solutions of dataflow equations in the DFG. Our construction algorithm is of independent interest because it can be used to construct a program's control dependence graph in O(E) time and its SSA representation in O(EV) time, which are improvements over existing algorithms.

Similar Papers
  • Conference Article
  • Citations118

Dependence-based program analysis

  • Jun 01, 1993
  • Richard Johnson +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
  • Book Chapter
  • Citations9

If-Conversion in SSA Form

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

Towards Constructing the SSA form using Reaching Definitions Over Dominance Frontiers

  • Sep 01, 2019
  • Abu Naser Masud +1
  • Research Article
  • Citations10

More precise construction of static single assignment programs using reaching definitions

  • Apr 06, 2020
  • Journal of Systems and Software
  • Abu Naser Masud +1
  • Conference Article
  • Citations13

Verified construction of static single assignment form

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

Efficient static single assignment form for predication

  • Aug 25, 2005
  • A Stoutchinin +1
  • Conference Article
  • Citations13

Efficient static single assignment form for predication

  • Dec 01, 2001
  • Arthur Stoutchinin +1
  • Conference Article
  • Citations153

Array SSA form and its use in parallelization

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

Recovering the Memory Behavior of Executable Programs

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

Computing SSA Form with Matrices

  • Jul 01, 2007
  • Electronic Notes in Theoretical Computer Science
  • Quan Hoang Nguyen
  • Conference Article

An approach for pointer optimization using SSA based intermediate representation

  • Jun 01, 2011
  • Deodatta Barhate +1
  • Conference Article
  • Citations8

A type system equivalent to static single assignment

  • Jul 10, 2006
  • Yutaka Matsuno +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.