Sciweavers

17 search results - page 1 / 4
» Data Slicing: Separating the Heap into Independent Regions
Sort
View
CC
2005
Springer
120views System Software» more  CC 2005»
13 years 9 months ago
Data Slicing: Separating the Heap into Independent Regions
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...
Jeremy Condit, George C. Necula
PPDP
2009
Springer
13 years 10 months ago
Path-sensitive region analysis for mercury programs
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...
Quan Phan, Gerda Janssens
IANDC
2006
77views more  IANDC 2006»
13 years 3 months ago
Lower and upper bounds on obtaining history independence
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...
Niv Buchbinder, Erez Petrank
ICML
2000
IEEE
14 years 4 months ago
Discovering Homogeneous Regions in Spatial Data through Competition
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...
Slobodan Vucetic, Zoran Obradovic
APVIS
2009
13 years 4 months ago
Interactive feature extraction and tracking by utilizing region coherency
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...
Chris Muelder, Kwan-Liu Ma