Heap Abstractions for Static Analysis

@article{Kanvar2016HeapAF,
  title={Heap Abstractions for Static Analysis},
  author={Vini Kanvar and Uday P. Khedker},
  journal={ACM Comput. Surv.},
  year={2016},
  volume={49},
  pages={29:1-29:47}
}
Heap data is potentially unbounded and seemingly arbitrary. Hence, unlike stack and static data, heap data cannot be abstracted in terms of a fixed set of program variables. This makes it an interesting topic of study and there is an abundance of literature employing heap abstractions. Although most studies have addressed similar concerns, insights gained in one description of heap abstraction may not directly carry over to some other description. In our search of a unified theme, we view heap… CONTINUE READING
10 Citations
24 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Static Analysis: 11th International Symposium, SAS 2004, Verona, Italy, August 26-28, 2004

  • Marius Bozga, Radu Iosif, Yassine Lakhnech.
  • Proceedings. Springer, Berlin, 344–360. DOI:http…
  • 2004
Highly Influential
12 Excerpts

Similar Papers

Loading similar papers…