• Home
  • Search
  • An approach for pointer optimization using SSA based intermediate representation
  • https://doi.org/10.1109/icrtit.2011.5972428Copy DOI Icon

An approach for pointer optimization using SSA based intermediate representation

  • Jun 1, 2011
  • Deodatta Barhate +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

In optimizing compilers, most of the optimizing algorithms are applied on intermediate representation. Optimizing algorithms such as constant propagation can be applied on intermediate code using data flow analysis which is expensive regarding compilation time. Also for pointer variables, these algorithms cannot be applied directly on pointers as pointers are difficult to analyse. In this paper, new approach for applying optimization algorithms such as constant propagation on pointer variables has been proposed. To avoid data flow analysis, static single assignment (SSA) form is used for intermediate representation and for pointers, alias classes are used. So using SSA and each alias class as a single variable, constant propagation algorithm can be applied on pointer variables very efficiently.

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
  • Conference Article
  • Citations13

Verified construction of static single assignment form

  • Mar 17, 2016
  • Sebastian Buchwald +2
  • Book Chapter
  • Citations9

If-Conversion in SSA Form

  • Jan 01, 2004
  • Arthur Stoutchinin +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

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
  • Research Article
  • Citations3

Structural Encoding of Static Single Assignment Form

  • Nov 25, 2005
  • Electronic Notes in Theoretical Computer Science
  • Andreas Gal +2
  • Book Chapter
  • Citations18

Incremental computation of static single assignment form

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

SSA Translation Is an Abstract Interpretation

  • Jan 09, 2023
  • Proceedings of the ACM on Programming Languages
  • Matthieu Lemerre
  • 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
  • Book Chapter
  • Citations84

Concurrent static single assignment form and constant propagation for explicitly parallel programs

  • Jan 01, 1998
  • Jaejin Lee +2
  • Conference Article
  • Citations18

Formal verification of dead code elimination in Isabelle/HOL

  • Jan 01, 2005
  • J.O Blech +2
  • Research Article
  • Citations41

Algorithms for computing the static single assignment form

  • May 01, 2003
  • Journal of the ACM
  • Gianfranco Bilardi +1
  • Research Article
  • Citations1

Computing SSA Form with Matrices

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

Array SSA form and its use in parallelization

  • Jan 01, 1998
  • Kathleen Knobe +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.