24 search results - page 2 / 5 » Strongly typed memory areas programming systems-level data s... |
ESOP
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. Linear type systems allow destructive operations such as object deallocation and imperative updates of functional data structures. These operations and others, such as th...
ICFP
2008
ACM
14 years 5 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...
PLDI
2005
ACM
13 years 10 months ago
2005
ACM
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
EDBT
2000
ACM
13 years 8 months ago
2000
ACM
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
MICRO
2009
IEEE
13 years 12 months ago
2009
IEEE
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...