Combining shape analyses by intersecting abstractions

Gilad Arnold; Roman Manevich; Mooly Sagiv; Ran Shaham

Combining shape analyses by intersecting abstractions

Gilad Arnold, Roman Manevich, Mooly Sagiv, Ran Shaham

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

11 Scopus citations

Abstract

We consider the problem of computing the intersection (meet) of heap abstractions.This problem is useful, among other applications, to relate abstract memory states computed by forward analysis with abstract memory states computed by backward analysis. Since dynamically allocated heap objects have no static names, relating objects computed by different analyses cannot be done directly. We show that the problem of computing meet is computationally hard. We describe a constructive formulation of meet based on certain relations between abstract heap objects. The problem of enumerating those relations is reduced to finding constrained matchings in graphs. We implemented the algorithm in the TVLA system and used it to prove temporal heap properties of several small Java programs, and obtained empirical evidence showing the effectiveness of the meet algorithm.

Original language	English
Title of host publication	Verification, Model Checking, and Abstract Interpretation - 7th International Conference, VMCAI 2006, Proceedings
Pages	33-48
Number of pages	16
State	Published - 6 Jul 2006
Externally published	Yes
Event	7th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2006 - Charleston, SC, United States Duration: 8 Jan 2006 → 10 Jan 2006

Publication series

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

Conference

Conference	7th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2006
Country/Territory	United States
City	Charleston, SC
Period	8/01/06 → 10/01/06

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Cite this

Arnold, G., Manevich, R., Sagiv, M., & Shaham, R. (2006). Combining shape analyses by intersecting abstractions. In Verification, Model Checking, and Abstract Interpretation - 7th International Conference, VMCAI 2006, Proceedings (pp. 33-48). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3855 LNCS).

Arnold, Gilad ; Manevich, Roman ; Sagiv, Mooly et al. / Combining shape analyses by intersecting abstractions. Verification, Model Checking, and Abstract Interpretation - 7th International Conference, VMCAI 2006, Proceedings. 2006. pp. 33-48 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e0f3844b88df4b77bdffe66fb39cf264,

title = "Combining shape analyses by intersecting abstractions",

abstract = "We consider the problem of computing the intersection (meet) of heap abstractions.This problem is useful, among other applications, to relate abstract memory states computed by forward analysis with abstract memory states computed by backward analysis. Since dynamically allocated heap objects have no static names, relating objects computed by different analyses cannot be done directly. We show that the problem of computing meet is computationally hard. We describe a constructive formulation of meet based on certain relations between abstract heap objects. The problem of enumerating those relations is reduced to finding constrained matchings in graphs. We implemented the algorithm in the TVLA system and used it to prove temporal heap properties of several small Java programs, and obtained empirical evidence showing the effectiveness of the meet algorithm.",

author = "Gilad Arnold and Roman Manevich and Mooly Sagiv and Ran Shaham",

year = "2006",

month = jul,

day = "6",

language = "English",

isbn = "3540311394",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "33--48",

booktitle = "Verification, Model Checking, and Abstract Interpretation - 7th International Conference, VMCAI 2006, Proceedings",

note = "7th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2006 ; Conference date: 08-01-2006 Through 10-01-2006",

}

Arnold, G, Manevich, R, Sagiv, M & Shaham, R 2006, Combining shape analyses by intersecting abstractions. in Verification, Model Checking, and Abstract Interpretation - 7th International Conference, VMCAI 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3855 LNCS, pp. 33-48, 7th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2006, Charleston, SC, United States, 8/01/06.

Combining shape analyses by intersecting abstractions. / Arnold, Gilad; Manevich, Roman; Sagiv, Mooly et al.
Verification, Model Checking, and Abstract Interpretation - 7th International Conference, VMCAI 2006, Proceedings. 2006. p. 33-48 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3855 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Combining shape analyses by intersecting abstractions

AU - Arnold, Gilad

AU - Manevich, Roman

AU - Sagiv, Mooly

AU - Shaham, Ran

PY - 2006/7/6

Y1 - 2006/7/6

N2 - We consider the problem of computing the intersection (meet) of heap abstractions.This problem is useful, among other applications, to relate abstract memory states computed by forward analysis with abstract memory states computed by backward analysis. Since dynamically allocated heap objects have no static names, relating objects computed by different analyses cannot be done directly. We show that the problem of computing meet is computationally hard. We describe a constructive formulation of meet based on certain relations between abstract heap objects. The problem of enumerating those relations is reduced to finding constrained matchings in graphs. We implemented the algorithm in the TVLA system and used it to prove temporal heap properties of several small Java programs, and obtained empirical evidence showing the effectiveness of the meet algorithm.

AB - We consider the problem of computing the intersection (meet) of heap abstractions.This problem is useful, among other applications, to relate abstract memory states computed by forward analysis with abstract memory states computed by backward analysis. Since dynamically allocated heap objects have no static names, relating objects computed by different analyses cannot be done directly. We show that the problem of computing meet is computationally hard. We describe a constructive formulation of meet based on certain relations between abstract heap objects. The problem of enumerating those relations is reduced to finding constrained matchings in graphs. We implemented the algorithm in the TVLA system and used it to prove temporal heap properties of several small Java programs, and obtained empirical evidence showing the effectiveness of the meet algorithm.

UR - http://www.scopus.com/inward/record.url?scp=33745650097&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33745650097

SN - 3540311394

SN - 9783540311393

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 33

EP - 48

BT - Verification, Model Checking, and Abstract Interpretation - 7th International Conference, VMCAI 2006, Proceedings

T2 - 7th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2006

Y2 - 8 January 2006 through 10 January 2006

ER -

Combining shape analyses by intersecting abstractions

Abstract

Publication series

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this