Modular shape analysis for dynamically encapsulated programs

N. Rinetzky*, A. Poetzsch-Heffter, G. Ramalingam, M. Sagiv, E. Yahav

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We present a modular static analysis which identifies structural (shape) invariants for a subset of heap-manipulating programs. The subset is defined by means of a non-standard operational semantics which places certain restrictions on aliasing and sharing across modules. More specifically, we assume that live references (i.e., used before set) between subheaps manipulated by different modules form a tree. We develop a conservative static analysis algorithm by abstract interpretation of our non-standard semantics. Our modular algorithm also ensures that the program obeys the above mentioned restrictions.

Original languageEnglish
Title of host publicationProgramming Languages and Systems - 16th European Symposium on Programming, ESOP 2007. Held as Part of the Joint European Conferences on Theory and Practics of Software, ETAPS 2007, Proceedings
PublisherSpringer Verlag
Number of pages17
ISBN (Print)354071314X, 9783540713142
StatePublished - 2007
Event16th European Symposium on Programming, ESOP 2007 - PRT, Portugal
Duration: 24 Mar 20071 Apr 2007

Publication series

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


Conference16th European Symposium on Programming, ESOP 2007


Dive into the research topics of 'Modular shape analysis for dynamically encapsulated programs'. Together they form a unique fingerprint.

Cite this