74 search results - page 2 / 15 » An Evaluation of Slicing Algorithms for Concurrent Programs |
ICSE
2003
IEEE-ACM
14 years 4 months ago
2003
IEEE-ACM
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...
WDAG
2001
Springer
13 years 9 months ago
2001
Springer
We generalize the notion of slice introduced in our earlier paper [6]. A slice of a distributed computation with respect to a global predicate is the smallest computation that cont...
ESE
2007
13 years 4 months ago
2007
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...
INFSOF
2008
13 years 4 months ago
2008
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
ISSTA
2010
ACM
13 years 8 months ago
2010
ACM
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, ...