Memory slicing

Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such as space requirement is decided by execution length; dependence graphs are highly redundant so that inspecting them is labor intensive. In this paper, we propose a data-centric dynamic slicing technique, in which dependences are introduced between memory locations. Doing so, the space complexity is bounded by memory footprint instead of execution length. Moreover, presenting dependences between memory locations is often more desirable for human inspection during debugging as redundant dependences are suppressed. Our evaluation shows that the proposed technique supersedes traditional dynamic slicing techniques in terms of effectiveness and efficiency. Categories and Subject Descriptors D.2.5 [Software Engineering]: Testing and Debugging—Debugging aids, Tracing; D.3.4 [Programming Languages]: Processors—D...

• Type: Conference
• Year: 2009
• Where: ISSTA
• Authors: Bin Xin, Xiangyu Zhang
• Keywords: Dynamic Slicing Techniques, ISSTA 2009, Program Slicing, Slicing Techniques, Software Engineering