Sciweavers

138 search results - page 16 / 28
» Dynamic Slicing of Aspect-Oriented Programs
Sort
View
SIGSOFT
1994
ACM
15 years 1 months ago
Speeding up Slicing
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genev...
APSEC
1999
IEEE
15 years 1 months ago
Slicing Methods Using Static and Dynamic Analysis Information
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 ...
Yoshiyuki Ashida, Fumiaki Ohata, Katsuro Inoue
PPDP
1999
Springer
15 years 1 months ago
Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
Ulrich Neumerkel, Frédéric Mesnard
ISCA
2000
IEEE
111views Hardware» more  ISCA 2000»
15 years 1 months ago
Understanding the backward slices of performance degrading instructions
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...
Craig B. Zilles, Gurindar S. Sohi
ICPP
2008
IEEE
15 years 3 months ago
Taming Single-Thread Program Performance on Many Distributed On-Chip L2 Caches
This paper presents a two-part study on managing distributed NUCA (Non-Uniform Cache Architecture) L2 caches in a future manycore processor to obtain high singlethread program per...
Lei Jin, Sangyeun Cho