Abstract
A program dependence graph (PDG) is used for computing program slices. To construct a PDG, we need dependency analysis of statements, which is very expensive in terms of memory space and computation time. In order to increase the efficiency of this analysis, we propose an algorithm for constructing a PDG in which several statements share their dependency information. In order not to degrade the precision of the resulting slice, we investigate the dependency locality of statements to be shared. The effectiveness of this approach has been investigated. Our experimental results show that the space utility decreased by 6.72–49.79% and the analysis time decreased by 4.14–33.21%. Also, a criterion on the locality of statement merging has been studied.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
