494 search results - page 7 / 99 » Heap Building Bounds |
128
click to vote
LPAR
2010
Springer
14 years 12 months ago
2010
Springer
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
WAIM
2007
Springer
15 years 8 months ago
2007
Springer
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
107
click to vote
EUROPAR
2001
Springer
15 years 6 months ago
2001
Springer
This paper is on the construction of a server subsystem in a client/server system in an application context where the number of potential clients can be arbitrarily large. The imp...
CPM
2010
Springer
15 years 6 months ago
2010
Springer
134
click to vote
IWMM
2010
Springer
15 years 3 months ago
2010
Springer
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...