Sciweavers

601 search results - page 70 / 121
» Lattice-based memory allocation
Sort
View
VSTTE
2010
Springer
13 years 5 months ago
Reusable Verification of a Copying Collector
Garbage collectors are very hard to implement correctly due to their low-level manipulation of memory. In this paper, we construct a copying garbage collector which we have proved ...
Magnus O. Myreen
ICSM
2009
IEEE
14 years 2 months ago
Senseo: Enriching Eclipse's static source views with dynamic metrics
Maintaining object-oriented systems that use inheritance and polymorphism is difficult, since runtime information, such as which methods are actually invoked at a call site, is n...
David Röthlisberger, Marcel Harry, Alex Villa...
HPCC
2007
Springer
14 years 1 months ago
Coarse-Grain Time Slicing with Resource-Share Control in Parallel-Job Scheduling
Abstract. We present a parallel job scheduling approach for coarsegrain timesharing which preempts jobs to disk and avoids any additional memory pressure. The approach provides con...
Bryan Esbaugh, Angela C. Sodan
AADEBUG
1997
Springer
13 years 12 months ago
Assertions for Dynamic Shape Analysis of List Data Structures
We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for ...
Mikhail Auguston, Miu Har Hon
SERP
2007
13 years 9 months ago
Runtime Support of Speculative Optimization for Offline Escape Analysis
Escape analysis can improve the speed and memory efficiency of garbage collected languages by allocating objects to the call stack, but an offline analysis will potentially interf...
Kevin Cleereman, Michelle Cheatham, Krishnaprasad ...