90 search results - page 11 / 18 » A type theory for memory allocation and data layout |
IFM
2010
Springer
13 years 5 months ago
2010
Springer
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
SAS
2007
Springer
14 years 1 months ago
2007
Springer
We present a new pointer analysis for use in shared memory programs running on hierarchical parallel machines. The analysis is motivated by the partitioned global address space lan...
ICS
2001
Tsinghua U.
14 years 4 days ago
2001
Tsinghua U.
Application performance tuning is a complex process that requires assembling various types of information and correlating it with source code to pinpoint the causes of performance...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Reasoning about imperative programs requires the ability to track aliasing and ownership properties. We present a type system that provides this ability, by using regions, capabil...