273 search results - page 8 / 55 » Improving program slicing with dynamic points-to data |
ORL
2000
14 years 9 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
SIGSOFT
2001
ACM
15 years 10 months ago
2001
ACM
Layered architecture in operating system code is often compromised by execution path-specific customizations such as prefetching, page replacement and scheduling strategies. Paths...
CSMR
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper we present a new instrumentation approach to reverse engineer a given software application. Our approach is based on aspect-oriented programming and provides support...
MICCAI
2003
Springer
15 years 10 months ago
2003
Springer
We are in the process of constructing a high resolution, high signal to noise ratio (SNR) dynamic MRI dataset for the human heart using methodology similar to that employed to cons...
PLDI
2010
ACM
15 years 2 months ago
2010
ACM
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...