1392 search results - page 37 / 279 » Dynamic Data Structure Analysis for Java Programs |
ACMMSP
2005
ACM
15 years 3 months ago
2005
ACM
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
86
Voted
ICLP
1999
Springer
15 years 1 months ago
1999
Springer
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...
OOPSLA
2009
Springer
15 years 4 months ago
2009
Springer
We present Chorus, a high-level parallel programming model suitable for irregular, heap-manipulating applications like mesh refinement and epidemic simulations, and JChorus, an i...
FASE
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The reality of multi-core hardware has made concurrent programs pervasive. Unfortunately, writing correct concurrent programs is difficult. Atomicity violation, which is ...
ACSC
2005
IEEE
15 years 3 months ago
2005
IEEE
We introduce a new approach to computing interprocedural modification side effects for Java programs in the presence of dynamic class loading. When compile-time unknown classes c...