Sciweavers

Share
SIGSOFT
2002
ACM

Improving program slicing with dynamic points-to data

10 years 3 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise pointer analyses have been suggested as one cause of this problem. In this paper, we use dynamic points-to data, which represents optimal or optimistic pointer information, to obtain a bound on the best case slice size improvement that can be achieved with improved pointer precision. Our experiments show that slice size can be reduced significantly for programs that make frequent use of calls through function pointers because for them the dynamic pointer data results in a considerably smaller call graph, which leads to fewer data dependences. Programs without or with only few calls through function pointers, however, show only insignificant improvement. We identified Amdahl's law as the reason for this behavior: C programs appear to have a large fraction of direct data dependences so that reducing spurious ...
Markus Mock, Darren C. Atkinson, Craig Chambers, S
Added 20 Nov 2009
Updated 20 Nov 2009
Type Conference
Year 2002
Where SIGSOFT
Authors Markus Mock, Darren C. Atkinson, Craig Chambers, Susan J. Eggers
Comments (0)
books