Solving Shape-Analysis Problems in Languages with Destructive Updating (1996)
Cached
Download Links
| Venue: | POPL '96 |
| Citations: | 281 - 18 self |
BibTeX
@MISC{Sagiv96solvingshape-analysis,
author = {Mooly Sagiv and Thomas Repst and Reinhard Wilhelm},
title = {Solving Shape-Analysis Problems in Languages with Destructive Updating},
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper concerns the static analysis of programs that perform destructive updating on heap-allocated storage. We give an algorithm that conservatively solves this problem by using a finite shape-graph to approximate the possible “shapes” that heap-allocated structures in a program can take on. In contrast with previous work, our method M even accurate for certain programs that update cyclic data structures. For example, our method can determine that when the input to a program that searches a list and splices in a new element is a possibly circular list, the output is a possibly circular list.
