Shape analysis by graph decomposition

R. Manevich, J. Berdine, B. Cook, G. Ramalingam, M. Sagiv

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

11 Scopus citations

Abstract

Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the program satisfies certain safety properties or invariants. In this paper, we show how this independence between different (singly-linked) data structures can be utilized to perform shape analysis and verification more efficiently. We present a new abstraction based on decomposing graphs into sets of subgraphs, and show that, in practice, this new abstraction leads to very little loss of precision, while yielding substantial improvements to efficiency.

Original languageEnglish
Title of host publicationTools and Algorithms for the Construction and Analysis of Systems - 13th International Conference, TACAS 2007. Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007
EditorsOrna Grumberg, Michael Huth
PublisherSpringer Verlag
Pages3-18
Number of pages16
ISBN (Electronic)9783540712091
ISBN (Print)9783540712084
DOIs
StatePublished - 1 Jan 2007
Externally publishedYes
Event13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, (TACAS 2007) - Braga, 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)
Volume4424 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, (TACAS 2007)
Country/TerritoryPortugal
CityBraga
Period24/03/071/04/07

Fingerprint

Dive into the research topics of 'Shape analysis by graph decomposition'. Together they form a unique fingerprint.

Cite this