Sciweavers

13 search results - page 2 / 3
» Pointer Programs and Undirected Reachability
Sort
View
ECOOP
2001
Springer
13 years 9 months ago
On the Usefulness of Liveness for Garbage Collection and Leak Detection
Abstract. The effectiveness of garbage collectors and leak detectors in identifying dead objects depends on the “accuracy” of their reachability traversal. Accuracy has two ort...
Martin Hirzel, Amer Diwan, Antony L. Hosking
ISSTA
2012
ACM
11 years 7 months ago
Static memory leak detection using full-sparse value-flow analysis
We introduce a static detector, Saber, for detecting memory leaks in C programs. Leveraging recent advances on sparse pointer analysis, Saber is the first to use a full-sparse va...
Yulei Sui, Ding Ye, Jingling Xue
ATVA
2009
Springer
125views Hardware» more  ATVA 2009»
13 years 11 months ago
Automated Analysis of Data-Dependent Programs with Dynamic Memory
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederbe...
PLDI
2006
ACM
13 years 11 months ago
Termination proofs for systems code
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...
Byron Cook, Andreas Podelski, Andrey Rybalchenko
ECOOP
2009
Springer
14 years 5 months ago
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
Guoqing Xu, Atanas Rountev, Manu Sridharan