Efficiently computing static single assignment form and the control dependence graph
- 1 October 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 13 (4), 451-490
- https://doi.org/10.1145/115372.115320
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The priority-based coloring approach to register allocationACM Transactions on Programming Languages and Systems, 1990
- An interval-based approach to exhaustive and incremental interprocedural data-flow analysisACM Transactions on Programming Languages and Systems, 1990
- Integrating noninterfering versions of programsACM Transactions on Programming Languages and Systems, 1989
- An overview of the PTRAN analysis system for multiprocessingJournal of Parallel and Distributed Computing, 1988
- Detecting conflicts between structure accessesPublished by Association for Computing Machinery (ACM) ,1988
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987
- Efficient symbolic analysis of programsJournal of Computer and System Sciences, 1986
- A Formal Framework for the Derivation of Machine-Specific OptimizersACM Transactions on Programming Languages and Systems, 1983
- Register allocation via coloringComputer Languages, 1981
- A fast algorithm for finding dominators in a flowgraphACM Transactions on Programming Languages and Systems, 1979