Incremental computation of static single assignment form
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 223-237
- https://doi.org/10.1007/3-540-61053-7_64
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Automated assistance for program restructuringACM Transactions on Software Engineering and Methodology, 1993
- Efficient accommodation of may-alias information in SSA formPublished by Association for Computing Machinery (ACM) ,1993
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- Automatic construction of sparse data flow evaluation graphsPublished by Association for Computing Machinery (ACM) ,1991
- A critical analysis of incremental iterative data flow analysis algorithmsIEEE Transactions on Software Engineering, 1990
- An interval-based approach to exhaustive and incremental interprocedural data-flow analysisACM Transactions on Programming Languages and Systems, 1990
- An efficient hybrid algorithm for incremental data flow analysisPublished by Association for Computing Machinery (ACM) ,1990
- An overview of the PTRAN analysis system for multiprocessingJournal of Parallel and Distributed Computing, 1988
- Detecting equality of variables in programsPublished by Association for Computing Machinery (ACM) ,1988
- Invariance of Approximative Semantics with Respect to Program TransformationsInformatik-Fachberichte, 1981