Interprocedural slicing using dependence graphs
- 1 June 1988
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 23 (7), 35-46
- https://doi.org/10.1145/53990.53994
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- The program summary graph and flow-sensitive interprocedual data flow analysisPublished by Association for Computing Machinery (ACM) ,1988
- Integrating non-intering versions of programsPublished by Association for Computing Machinery (ACM) ,1988
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987
- The program dependence graph in a software development environmentPublished by Association for Computing Machinery (ACM) ,1984
- A precise inter-procedural data flow algorithmPublished by Association for Computing Machinery (ACM) ,1981
- Ordered attributed grammarsActa Informatica, 1980
- An efficient way to find the side effects of procedure calls and the aliases of variablesPublished by Association for Computing Machinery (ACM) ,1979
- The method of attributes for data flow analysisActa Informatica, 1978
- On Live-Dead Analysis for Global Data Flow ProblemsJournal of the ACM, 1977
- Semantics of context-free languagesTheory of Computing Systems, 1968