773 search results - page 31 / 155 » Program Slicing by Calculation |
136
click to vote
ISCA
2000
IEEE
15 years 7 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...
SCP
2010
15 years 1 months ago
2010
One of the most challenging tasks a programmer can face is attempting to analyse and understand a legacy assembler system. Many features of assembler make analysis difficult, and ...
149
click to vote
WORDS
2003
IEEE
15 years 8 months ago
2003
IEEE
Bounding the Worst Case Execution Time (WCET) of programs is essential for real-time systems. To be able to do WCET calculations, the iteration bounds for loops and recursion must...
126
click to vote
SAS
2001
Springer
15 years 7 months ago
2001
Springer
Programs often have a lot of duplicated code, which makes both understanding and maintenance more difficult. This problem can be alleviated by detecting duplicated code, extracting...
106
click to vote
NAACL
2010
15 years 1 months ago
2010
This paper describes an efficient sampler for synchronous grammar induction under a nonparametric Bayesian prior. Inspired by ideas from slice sampling, our sampler is able to dra...