Interprocedural modification side effect analysis with pointer aliasing
Authors:
- William LandiWLWilliam Landi
- Barbara G. RyderBRBarbara G. Ryder
- Sean ZhangSZSean Zhang
Open Access
- 1 June 1993
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 28 (6) , 56-67
Abstract
We present a new interprocedural modification side effects algorithm for C programs, that can discern side effects through general-purpose pointer usage. Ours is the first complete design and implementation of such an algorithm. Preliminary performance findings support the practicality of the technique, which is based on our previous approximation algorithm for pointer aliases [LR92]. Each indirect store through a pointer variable is found, on average, to correspond to a store into 1.2 locations. This indicates that our program-point-specific pointer aliasing information is quite precise when used to determine the effects of these stores.Keywords
This publication has 17 references indexed in Scilit:
- A safe approximate algorithm for interprocedural aliasing1992
- Interprocedural Def-Use associations in C programs1991
- Data flow-based test adequacy analysis for languages with pointers1991
- The semantic approach to program slicing1991
- An interval-based approach to exhaustive and incremental interprocedural data-flow analysisACM Transactions on Programming Languages and Systems, 1990
- Lifetime analysis of dynamically allocated objects1988
- Interprocedural dependence analysis and parallelization1986
- The program dependence graph in a software development environment1984
- Efficient computation of flow insensitive interprocedural summary information1984
- A practical interprocedural data flow analysis algorithmCommunications of the ACM, 1978