Heap Decomposition for Concurrent Shape Analysis

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

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.

Details

Publication typeInproceedings
Published inStatic Analysis, 15th International Symposium, SAS 2008, Valencia, Spain, July 16-18, 2008. Proceedings
Pages363-377
Volume5079
SeriesLecture Notes in Computer Science
ISBN978-3-540-69163-1
PublisherSpringer Verlag

Previous versions

Roman Manevich, Tal Lev-Ami, Mooly Sagiv, Ganesan Ramalingam, and Josh Berdine. Heap Decomposition for Concurrent Shape Analysis, November 2007.

> Publications > Heap Decomposition for Concurrent Shape Analysis