Region inference is a program analysis which statically determines regions of memory in which values are stored. Regions are allocated and de-allocated according to a stack discipline. Region inference is an attractive alternative to dynamic memory management via garbage collection for the implementation of mission-critical applications, of inter-operating system components, of certifiable software. In the aim of putting region-based memory management to work for the design and implementation of real-time system software, the goal of the present article is to consolidate present knowledge on region-based memory management by giving a simplified account of region inference. We achieve this goal by giving an inductive proof of correctness for...
Dividing the heap memory of programs into regions is the starting point of region-based memory manag...
AbstractThe region calculus of Tofte and Talpin is a polymorphically typed lambda calculus with anno...
The region calculus of Tofte and Talpin is a polymorphically typed lambda cal-culus with annotations...
AbstractRegion inference is a type-based technique for determining run time memory management at com...
Abstract. Region-based memory management has been proposed as a viable alternative to garbage collec...
AbstractThis paper describes a memory management discipline for programs that perform dynamic memory...
This paper describes a memory management discipline for programs that perform dynamic memory allocat...
Abstract. Safe is a first-order eager language with facilities for pro-grammer controlled destructio...
Region-based memory management offers several important potential advantages over garbage collection...
This paper presents a region inference framework designed specifically for imperative programs with...
Region-based memory management is a technique to do compile-time memory management based on the idea...
Region-based memory management has been proposed as a viable alternative to garbage collection for r...
This paper describes a memory discipline that combines region-based memory management and copying ga...
Region-based memory management is a form of compile-time memory management, well-known from the func...
Region-based memory management is an alternative to standard tracing garbage collection that makes o...
Dividing the heap memory of programs into regions is the starting point of region-based memory manag...
AbstractThe region calculus of Tofte and Talpin is a polymorphically typed lambda calculus with anno...
The region calculus of Tofte and Talpin is a polymorphically typed lambda cal-culus with annotations...
AbstractRegion inference is a type-based technique for determining run time memory management at com...
Abstract. Region-based memory management has been proposed as a viable alternative to garbage collec...
AbstractThis paper describes a memory management discipline for programs that perform dynamic memory...
This paper describes a memory management discipline for programs that perform dynamic memory allocat...
Abstract. Safe is a first-order eager language with facilities for pro-grammer controlled destructio...
Region-based memory management offers several important potential advantages over garbage collection...
This paper presents a region inference framework designed specifically for imperative programs with...
Region-based memory management is a technique to do compile-time memory management based on the idea...
Region-based memory management has been proposed as a viable alternative to garbage collection for r...
This paper describes a memory discipline that combines region-based memory management and copying ga...
Region-based memory management is a form of compile-time memory management, well-known from the func...
Region-based memory management is an alternative to standard tracing garbage collection that makes o...
Dividing the heap memory of programs into regions is the starting point of region-based memory manag...
AbstractThe region calculus of Tofte and Talpin is a polymorphically typed lambda calculus with anno...
The region calculus of Tofte and Talpin is a polymorphically typed lambda cal-culus with annotations...