Simple and efficient construction of static single assignment form

Authors:
Matthias Braun;Sebastian Buchwald;Sebastian Hack;Roland Leißa;Christoph Mallon;Andreas Zwinkau
Affiliations:
Karlsruhe Institute of Technology, Germany;Karlsruhe Institute of Technology, Germany;Saarland University, Germany;Saarland University, Germany;Saarland University, Germany;Karlsruhe Institute of Technology, Germany
Venue:
CC'13 Proceedings of the 22nd international conference on Compiler Construction
Year:
2013

Citing 13
Cited 0

Global value numbers and redundant computations

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic construction of sparse data flow evaluation graphs

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Single-pass generation of static single-assignment form for structured languages

ACM Transactions on Programming Languages and Systems (TOPLAS)
A linear time algorithm for placing &phgr;-nodes

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A correspondence between continuation passing style and static single assignment form

IR '95 Papers from the 1995 ACM SIGPLAN workshop on Intermediate representations
A simple graph-based intermediate representation

IR '95 Papers from the 1995 ACM SIGPLAN workshop on Intermediate representations
SSA is functional programming

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

Software—Practice & Experience
Characterizations of Reducible Flow Graphs

Journal of the ACM (JACM)
Simple Generation of Static Single-Assignment Form

CC '00 Proceedings of the 9th International Conference on Compiler Construction
Programming languages and their compilers: Preliminary notes

Programming languages and their compilers: Preliminary notes
The java hotspotTM server compiler

JVM'01 Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple SSA construction algorithm, which allows direct translation from an abstract syntax tree or bytecode into an SSA-based intermediate representation. The algorithm requires no prior analysis and ensures that even during construction the intermediate representation is in SSA form. This allows the application of SSA-based optimizations during construction. After completion, the intermediate representation is in minimal and pruned SSA form. In spite of its simplicity, the runtime of our algorithm is on par with Cytron et al.'s algorithm.