Sciweavers

319 search results - page 3 / 64
» Precise Dynamic Slicing Algorithms
Sort
View
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
AADEBUG
2005
Springer
13 years 11 months ago
Experimental evaluation of using dynamic slices for fault location
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, Haifeng He, Neelam Gupta, Rajiv Gup...
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
ISSTA
2010
ACM
13 years 9 months ago
Analyzing concurrency bugs using dual slicing
Recently, there has been much interest in developing analyzes to detect concurrency bugs that arise because of data races, atomicity violations, execution omission, etc. However, ...
Dasarath Weeratunge, Xiangyu Zhang, William N. Sum...
SIGSOFT
1995
ACM
13 years 9 months ago
Precise Interprocedural Chopping
The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many software-engineering problems, including program understanding,...
Thomas W. Reps, Genevieve Rosay