17 search results - page 1 / 4 » Data Slicing: Separating the Heap into Independent Regions |
CC
2005
Springer
14 years 3 months ago
2005
Springer
In this paper, we present a formal description of data slicing, which is a type-directed program transformation technique that separates a program’s heap into several independent...
PPDP
2009
Springer
14 years 4 months ago
2009
Springer
Dividing the heap memory of programs into regions is the starting point of region-based memory management. In our existing work of enabling region-based memory management for Merc...
IANDC
2006
13 years 9 months ago
2006
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
ICML
2000
IEEE
14 years 10 months ago
2000
IEEE
If all features causing heterogeneity were observed, a mixture of experts approach (Jacobs et al., 1991) is likely to be superior to using a single model. When unobserved or very n...
APVIS
2009
13 years 11 months ago
2009
The ability to extract and follow time-varying flow features in volume data generated from large-scale numerical simulations enables scientists to effectively see and validate mod...