Sciweavers

1392 search results - page 182 / 279
» Dynamic Data Structure Analysis for Java Programs
Sort
View
CC
2008
Springer
172views System Software» more  CC 2008»
14 years 11 months ago
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...
Mark Marron, Manuel V. Hermenegildo, Deepak Kapur,...
SPAA
2009
ACM
15 years 10 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
SCAM
2006
IEEE
15 years 3 months ago
Characterising, Explaining, and Exploiting the Approximate Nature of Static Analysis through Animation
This paper addresses the question: “How can animated visualisation be used to express interesting properties of static analysis?” The particular focus is upon static dependenc...
David Binkley, Mark Harman, Jens Krinke
BMCBI
2006
178views more  BMCBI 2006»
14 years 9 months ago
GOLEM: an interactive graph-based gene-ontology navigation and analysis tool
Background: The Gene Ontology has become an extremely useful tool for the analysis of genomic data and structuring of biological knowledge. Several excellent software tools for na...
Rachel S. G. Sealfon, Matthew A. Hibbs, Curtis Hut...
CF
2006
ACM
14 years 11 months ago
Intermediately executed code is the key to find refactorings that improve temporal data locality
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
Kristof Beyls, Erik H. D'Hollander