Sciweavers

3925 search results - page 518 / 785
» Measuring software evolution
Sort
View
106
Voted
EMSOFT
2009
Springer
15 years 10 months ago
Probabilistic modeling of data cache behavior
In this paper, we propose a formal analysis approach to estimate the expected (average) data cache access time of an application across all possible program inputs. Towards this g...
Vinayak Puranik, Tulika Mitra, Y. N. Srikant
123
Voted
ISSTA
2009
ACM
15 years 10 months ago
Memory slicing
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
Bin Xin, Xiangyu Zhang
CGO
2008
IEEE
15 years 10 months ago
Branch-on-random
We propose a new instruction, branch-on-random, that is like a standard conditional branch, except rather than specifying the condition on which the branch should be taken, it spe...
Edward Lee, Craig B. Zilles
129
Voted
MEMOCODE
2008
IEEE
15 years 10 months ago
Estimating the Performance of Cache Replacement Policies
—Caches are commonly employed to hide the latency gap between memory and the CPU by exploiting locality in memory accesses. The cache performance strongly influences a system’...
Daniel Grund, Jan Reineke
116
Voted
QSIC
2008
IEEE
15 years 10 months ago
Fault Localization with Non-parametric Program Behavior Model
Fault localization is a major activity in software debugging. Many existing statistical fault localization techniques compare feature spectra of successful and failed runs. Some a...
Peifeng Hu, Zhenyu Zhang, Wing Kwong Chan, T. H. T...