Interprocedural shape analysis for effectively cutpoint-free programs

J. Kreiker, T. Reps, N. Rinetzky, M. Sagiv, Reinhard Wilhelm, E. Yahav

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

We present a framework for local interprocedural shape analysis that computes procedure summaries as transformers of procedure-local heaps (the parts of the heap that the procedure may reach). A main challenge in procedurelocal shape analysis is the handling of cutpoints, objects that separate the input heap of an invoked procedure from the rest of the heap, which - from the viewpoint of that invocation - is non-accessible and immutable. In this paper, we limit our attention to effectively cutpoint-free programs - programs in which the only objects that separate the callee's heap from the rest of the heap, when considering live reference fields, are the ones pointed to by the actual parameters of the invocation. This limitation (and certain variations of it, which we also describe) simplifies the local-reasoning about procedure calls because the analysis needs not track cutpoints. Furthermore, our analysis (conservatively) verifies that a program is effectively cutpoint-free,

Original languageEnglish
Title of host publicationProgramming Logics
Subtitle of host publicationEssays in Memory of Harald Ganzinger
EditorsAndrei Voronkov, Christoph Weidenbach
PublisherSpringer Berlin Heidelberg
Pages414-445
Number of pages32
ISBN (Print)9783642376504
DOIs
StatePublished - 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7797 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Interprocedural shape analysis for effectively cutpoint-free programs'. Together they form a unique fingerprint.

Cite this