9 search results - page 1 / 2 » Dynamic slicing long running programs through execution fast... |
SIGSOFT
2006
ACM
14 years 5 months ago
2006
ACM
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
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...
MICRO
2005
IEEE
13 years 10 months ago
2005
IEEE
As more data value speculation mechanisms are being proposed to speed-up processors, there is growing pressure on the critical processor structures that must buffer the state of t...
ISSRE
2006
IEEE
13 years 10 months ago
2006
IEEE
Forward computation of dynamic slices is necessary to support interactive debugging and online analysis of long running programs. However, the overhead of existing forward computi...
IPPS
2002
IEEE
13 years 9 months ago
2002
IEEE
This paper presents preliminary efforts to develop compilation and execution environments that achieve performance portability of multilevel parallelization on hierarchical archit...