Sciweavers

319 search results - page 41 / 64
» Age-Based Garbage Collection
Sort
View
VLDB
1990
ACM
86views Database» more  VLDB 1990»
13 years 11 months ago
How to Forget the Past Without Repeating It
Bottom-up evaluation of deductive database programs has the advantage that it avoids repeated computation by storing all intermediate results and replacing recomputation by table ...
Jeffrey F. Naughton, Raghu Ramakrishnan
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 ...
DLOG
1996
13 years 9 months ago
An HTML Interface for Classic
Several significant problems exist whenapplying knowledge representation systems to real problems. In particular, the obscurity of LISP, the resource consumption, garbage collecti...
Christopher A. Welty
POPL
2007
ACM
14 years 8 months ago
Dynamic heap type inference for program understanding and debugging
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
Ben Liblit, Chloë W. Schulze, Marina Polishch...
PLDI
2009
ACM
14 years 2 months ago
Dynamic software updates: a VM-centric approach
Software evolves to fix bugs and add features. Stopping and restarting programs to apply changes is inconvenient and often costly. Dynamic software updating (DSU) addresses this ...
Suriya Subramanian, Michael W. Hicks, Kathryn S. M...