Sciweavers

1392 search results - page 39 / 279
» Dynamic Data Structure Analysis for Java Programs
Sort
View
OOPSLA
2005
Springer
15 years 3 months ago
Demand-driven points-to analysis for Java
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav...
IEEEPACT
2003
IEEE
15 years 2 months ago
Compiler-Directed Content-Aware Prefetching for Dynamic Data Structures
This paper describes Compiler-Directed Content-Aware Prefetching (CDCAP), an integrated compiler and hardware approach for prefetching dynamic data structures. The approach utiliz...
Hassan Al-Sukhni, Ian Bratt, Daniel A. Connors
PPOPP
2003
ACM
15 years 2 months ago
Hybrid dynamic data race detection
We present a new method for dynamically detecting potential data races in multithreaded programs. Our method improves on the state of the art in accuracy, in usability, and in ove...
Robert O'Callahan, Jong-Deok Choi
SIGSOFT
2002
ACM
15 years 10 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
JSS
2006
85views more  JSS 2006»
14 years 9 months ago
Effects of context on program slicing
Whether context-sensitive program analysis is more effective than context-insensitive analysis is an ongoing discussion. There is evidence that context-sensitivity matters in comp...
Jens Krinke