AbstractThis paper describes the rst algorithm that calculates Interprocedural Def-Use Associations in C software systems. Our algorithm accounts for program-point-specic pointer-induced aliases, although it is currently limited to programs using a single level of indirection. We prove the NP-hardness of the Interprocedural Reaching Denitions Problem and point out the approximation made by our polynomial-time algorithm. Initial empirical results are also presented.
RightsThis Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).