A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Interprocedural Shape Analysis for Recursive Programs
[chapter]
2001
Lecture Notes in Computer Science
A shape-analysis algorithm statically analyzes a program to determine information about the heap-allocated data structures that the program manipulates. The results can be used to optimize, understand, debug, or verify programs. Existing algorithms are quite imprecise in the presence of recursive procedure calls. This is unfortunate, since recursion provides a natural way to manipulate linked data structures. We present a novel technique for shape analysis of recursive programs. An algorithm
doi:10.1007/3-540-45306-7_10
fatcat:ky2oosu4dve5be6ytjjlgvuzya