297 search results - page 3 / 60 » Heap Reference Analysis Using Access Graphs |
VMCAI
2010
Springer
15 years 7 months ago
2010
Springer
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
ISPAN
2002
IEEE
15 years 3 months ago
2002
IEEE
Many applications written in C allocate memory blocks for their major data structures from the heap space at runtime. The analysis of heap-oriented pointers in such programs is cr...
101
click to vote
SOFTVIS
2010
ACM
14 years 10 months ago
2010
ACM
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
109
click to vote
CC
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap annotated with a set o...
182
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
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...