We present the first high-precision algorithm for obtaining Def-Use Associations in C programs with single level pointers. While the precise solution of the problem is NP-hard, our polynomial-time algorithm uses program-point-specific pointer-induced aliases to obtain good approximations to the set of definitions reaching a program point. This information is crucial to effective debugging, testing and maintenance of C software systems. Initial implementation experiences with this approach are presented.
CITATION STYLE
Pande, H. D., Ryder, B. G., & Landi, W. (1991). Interprocedural Def-Use Associations in C programs. In Proceedings of the Symposium on Testing, Analysis, and Verification, TAV 1991 (pp. 139–153). Association for Computing Machinery, Inc. https://doi.org/10.1145/120807.120820
Mendeley helps you to discover research relevant for your work.