Sciweavers

146 search results - page 2 / 30
» Monotonic Abstraction for Programs with Dynamic Memory Heaps
Sort
View
IWMM
2009
Springer
122views Hardware» more  IWMM 2009»
13 years 12 months ago
Parametric heap usage analysis for functional programs
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
Leena Unnikrishnan, Scott D. Stoller
PPOPP
2005
ACM
13 years 11 months ago
Revocable locks for non-blocking programming
In this paper we present a new form of revocable lock that streamlines the construction of higher level concurrency abstractions such as atomic multi-word heap updates. The key id...
Tim Harris, Keir Fraser
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
13 years 3 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
POPL
2007
ACM
14 years 5 months ago
Cork: dynamic memory leak detection for garbage-collected languages
A memory leak in a garbage-collected program occurs when the program inadvertently maintains references to objects that it no longer needs. Memory leaks cause systematic heap grow...
Maria Jump, Kathryn S. McKinley
APLAS
2001
ACM
13 years 9 months ago
An Effect System Combining Alias and Liveness for Explicit Memory Reuse
The garbage collection is a safe and efficient method for managing the heap. However it is not efficient for temporary storages that are allocated often and deallocated quickly. R...
Oukseh Lee