@inproceedings{dd1d2cdc42b14b2fbca6b4d10134c977,
title = "Shape analysis by graph decomposition",
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.",
author = "R. Manevich and J. Berdine and B. Cook and G. Ramalingam and M. Sagiv",
year = "2007",
month = jan,
day = "1",
doi = "10.1007/978-3-540-71209-1_3",
language = "English",
isbn = "9783540712084",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "3--18",
editor = "Orna Grumberg and Michael Huth",
booktitle = "Tools 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",
address = "Germany",
note = "13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, (TACAS 2007) ; Conference date: 24-03-2007 Through 01-04-2007",
}