3 search results - page 1 / 1 » Efficient Forward Computation of Dynamic Slices Using Reduce... |
ICSE
2004
IEEE-ACM
14 years 4 months ago
2004
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. Recently algorithms for forwar...
AADEBUG
2005
Springer
13 years 10 months ago
2005
Springer
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...
ICCTA
2007
IEEE
13 years 8 months ago
2007
IEEE
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...