Sciweavers

303 search results - page 1 / 61
» Typing Safe Deallocation
Sort
View
ESOP
2008
Springer
13 years 6 months ago
Typing Safe Deallocation
In this work we address the problem of proving, by static analysis means, that allocating and deallocating regions in the store provides a safe way to achieve memory management. Th...
Gérard Boudol
APLAS
2009
ACM
13 years 11 months ago
Fractional Ownerships for Safe Memory Deallocation
We propose a type system for a programming language with memory allocation/deallocation primitives, which prevents memory-related errors such as double-frees and memory leaks. The ...
Kohei Suenaga, Naoki Kobayashi
ICTAC
2005
Springer
13 years 10 months ago
Finding Resource Bounds in the Presence of Explicit Deallocation
Abstract. A software program requesting a resource that is not available usually raises an out-of-resource exception. Component software is software that has been assembled from st...
Hoang Truong, Marc Bezem
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
13 years 2 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
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...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
TIC
2000
Springer
174views System Software» more  TIC 2000»
13 years 8 months ago
Alias Types for Recursive Data Structures
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
David Walker, J. Gregory Morrisett