Citation Context

...ge of work on techniques for stack allocation of heap objects as well as techniques for static garbage collection, both of which are based on analyzing the lifetimes of objects in programs (e.g., see =-=[6, 42, 31]-=- and the references therein). These techniques do not attempt to analyze or control the layout of logical data structures in the heap per se, and are largely orthogonal to our work. A minor exception ...

Citation Context

...ections). While many programs are not cutpoint-free, we observe that a reasonable number of programs, including all examples used in [13, 19, 34] are cutpoint-free, as well as many of the programs in =-=[12, 37]-=-. One of the key observations in this paper, is that we can exploit cutpoint-freedom to construct an interprocedural shape analysis algorithm that efficiently reuses procedure summaries. In this paper...

Citation Context

...o analyses that can eliminate memory leaks in Java: the first detects dead entries in arrays that will never be read in the future [28], while the second uses shape analysis to detect dead references =-=[29]-=-. Lattner and Adve propose pool allocation, a transformation that can statically eliminate some leaks in C/C++ applications via points-to set liveness [13]. VM-techniques for memory management Appel a...

Citation Context

...event dangling-pointer dereferences. Finally, sophisticated interprocedural analyses are starting to appear to detect leaks (e.g., [26]) or more generally reason about temporal heap properties (e.g., =-=[36]-=-). It is not yet clear if they are cheap enough to run on every compilation or if they can give the strong safety guarantees of Cyclone’s intraprocedural analysis, especially in the presence of thread...

Citation Context

...ver used after line 10. The second facts[1] x = null; [2] while (...) { [3] y = new SLL(); [4] y.val = ...; [5] y.n = x; [6] x = y; } [7] y = x; // can insert "x = null;" here [8] while (y != null) { =-=[9]-=- System.out.print(y.val); [10] t = y.n; // can insert "free y;" or "y.n = null;" here [11] y = t; } Fig. 1: A program that creates a singly-linked list and traverses its elements is more challenging t...

Citation Context

...lysis does not consider aliasing, inter-procedural paths, or nested resources. Static analysis of resource leaks relies on analysis of a dynamic location liveness property as defined by Shaham et al. =-=[22]-=-. Shaham et al. presented a conservative static analysis based on canonical abstraction to verify safety of synthesized free operations for dynamically allocated objects. A similar analysis could be u...

Citation Context

...ary, here we have defined a framework which works for different kind of data structures representable by abstract predicates. A static analysis for detecting unused (garbage) objects is introduced in =-=[24]-=-. This analysis is similar to ours in its aim. However, the two approaches are sub-stantially different. The authors use finite state automata to encode safety properties of objects (for example “the...