Sciweavers

39 search results - page 3 / 8
» Dynamic Slicing Object-Oriented Programs for Debugging
Sort
View
ICSE
2003
IEEE-ACM
14 years 5 months ago
Precise Dynamic Slicing Algorithms
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
KBSE
2005
IEEE
13 years 11 months ago
Locating faulty code using failure-inducing chops
Software debugging is the process of locating and correcting faulty code. Prior techniques to locate faulty code either use program analysis techniques such as backward dynamic pr...
Neelam Gupta, Haifeng He, Xiangyu Zhang, Rajiv Gup...
ISSTA
2009
ACM
13 years 11 months ago
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...
Bin Xin, Xiangyu Zhang
ESE
2007
124views Database» more  ESE 2007»
13 years 5 months ago
A study of effectiveness of dynamic slicing in locating real faults
Dynamic slicing algorithms have been considered to aid in debugging for many years. However, as far as we know, no detailed studies on evaluating the benefits of using dynamic sl...
Xiangyu Zhang, Neelam Gupta, Rajiv Gupta
ICSE
2004
IEEE-ACM
14 years 5 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang