Heap decomposition for concurrent shape analysis

Roman Manevich, Tal Lev-Ami, Mooly Sagiv, Ganesan Ramalingam, Josh Berdine

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

Abstract

We demonstrate shape analyses that can achieve a state space reduction exponential in the number of threads compared to the state-of-the-art analyses, while retaining sufficient precision to verify sophisticated properties such as linearizability. The key idea is to abstract the global heap by decomposing it into (not necessarily disjoint) subheaps, abstracting away some correlations between them. These new shape analyses are instances of an analysis framework based on heap decomposition. This framework allows rapid prototyping of complex static analyses by providing efficient abstract transformers given user-specified decomposition schemes. Initial experiments confirm the value of heap decomposition in scaling concurrent shape analyses.

Original languageEnglish
Title of host publicationStatic Analysis - 15th International Symposium, SAS 2008, Proceedings
PublisherSpringer Verlag
Pages363-377
Number of pages15
ISBN (Print)3540691634, 9783540691631
DOIs
StatePublished - 2008
Event15th International Static Analysis Symposium, SAS 2008 - Valencia, Spain
Duration: 16 Jul 200818 Jul 2008

Publication series

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

Conference

Conference15th International Static Analysis Symposium, SAS 2008
Country/TerritorySpain
CityValencia
Period16/07/0818/07/08

Fingerprint

Dive into the research topics of 'Heap decomposition for concurrent shape analysis'. Together they form a unique fingerprint.

Cite this