Issue No. 05 - May (1994 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.286418
<p>Def-use analysis links possible value-setting statements for a variable (i.e. definitions) to potential value-fetches (i.e. uses) of that value. This paper describes the first algorithm that calculates accurate interprocedural def-use associations in C software systems. Our algorithm accounts for program-point-specific pointer-induced aliases, though it is currently limited to programs using a single level of indirection. We prove the NP-hardness of the interprocedural reaching definitions problem and describe the approximations made by our polynomial-time algorithm. Initial empirical results are also presented.</p>
computational complexity; C language; program compilers; program diagnostics; software engineering; data structures; interprocedural def-use associations; C software systems; single level pointers; value-setting statements; value-fetches; program-point-specific pointer-induced aliases; indirection; NP-hardness; interprocedural reaching definitions problem; polynomial-time algorithm; static analysis
H. Pande, W. Landi and B. Ryder, "Interprocedural Def-Use Associations for C Systems with Single Level Pointers," in IEEE Transactions on Software Engineering, vol. 20, no. , pp. 385-403, 1994.