Reference
Abstract
Interprocedural program analysis is often performed by computing procedure summaries. While possible, computing adequate summaries is difficult, particularly in the presence of recursive procedures. In this paper, we propose a complementary framework for interprocedural analysis based on a direct abstraction of the calling context. Specifically, our approach exploits the inductive structure of a calling context by treating it directly as a stack of activation records. We then build an abstraction based on separation logic with inductive definitions. A key element of this abstract domain is the use of parameters to refine the meaning of such call stack summaries and thus express relations across activation records and with the heap. In essence, we define an abstract interpretation-based analysis framework for recursive programs that permits a fluid per call site abstraction of the call stack—much like how shape analyzers enable a fluid per program point abstraction of the heap.
BibTeX
@string{POPL = "ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL)"}
@inproceedings{stack-popl11,
author = {Xavier RivalBor-Yuh Evan Chang},
title = {Calling Context Abstraction with Shapes},
booktitle = POPL,
year = {2011},
pages = {173-186},
}