Sciweavers

494 search results - page 7 / 99
» Heap Building Bounds
Sort
View
LPAR
2010
Springer
14 years 8 months ago
Verifying Pointer and String Analyses with Region Type Systems
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...
Lennart Beringer, Robert Grabowski, Martin Hofmann
WAIM
2007
Springer
15 years 4 months ago
Building Data Synopses Within a Known Maximum Error Bound
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...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
EUROPAR
2001
Springer
15 years 2 months ago
Building TMR-Based Reliable Servers Despite Bounded Input Lifetimes
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...
Paul D. Ezhilchelvan, Jean-Michel Hélary, M...
CPM
2010
Springer
130views Combinatorics» more  CPM 2010»
15 years 3 months ago
Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality
Omar AitMous, Frédérique Bassino, Cy...
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
15 years 7 days ago
Parametric inference of memory requirements for garbage collected languages
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...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...