114 search results - page 4 / 23 » Cost effective dynamic program slicing |
IPPS
2002
IEEE
15 years 4 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...
111
Voted
APSEC
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper, we propose four slicing methods using both static and dynamic analysis information. (1) StatementMark Slice : removes the unnecessary statements using an execution ...
100
click to vote
ISCA
2000
IEEE
15 years 4 months ago
2000
IEEE
For many applications, branch mispredictions and cache misses limit a processor’s performance to a level well below its peak instruction throughput. A small fraction of static i...
HASE
2008
IEEE
15 years 6 months ago
2008
IEEE
Model-based program debugging exploits discrepancies between the program behavior anticipated by a programmer and the program’s actual behavior when executed on a set of inputs....
PLDI
2005
ACM
15 years 5 months ago
2005
ACM
We present a new technique, path slicing, that takes as input a possibly infeasible path to a target location, and eliminates all the operations that are irrelevant towards the re...