Boolean Heaps

Podelski A, Wies T. 2005. Boolean Heaps. 12th International Symposium on Static Analysis. SAS: Static Analysis Symposium, LNCS, vol. 3672, 268–283.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published | English

Scopus indexed
Author
Podelski, Andreas; Wies, ThomasISTA
Series Title
LNCS
Abstract
We show that the idea of predicates on heap objects can be cast in the framework of predicate abstraction. This leads to an alternative view on the underlying concepts of three-valued shape analysis by Sagiv, Reps and Wilhelm. Our construction of the abstract post operator is analogous to the corresponding construction for classical predicate abstraction, except that predicates over objects on the heap take the place of state predicates, and boolean heaps (sets of bitvectors) take the place of boolean states (bitvectors). A program is abstracted to a program over boolean heaps. For each command of the program, the corresponding abstract command is effectively constructed by deductive reasoning, namely by the application of the weakest precondition operator and an entailment test. We thus obtain a symbolic framework for shape analysis.
Publishing Year
Date Published
2005-01-01
Proceedings Title
12th International Symposium on Static Analysis
Publisher
Springer
Volume
3672
Page
268-283
Conference
SAS: Static Analysis Symposium
Conference Location
London, United Kingdom
Conference Date
2005-09-07 – 2005-09-09
IST-REx-ID

Cite this

Podelski A, Wies T. Boolean Heaps. In: 12th International Symposium on Static Analysis. Vol 3672. Springer; 2005:268-283. doi:10.1007/11547662_19
Podelski, A., & Wies, T. (2005). Boolean Heaps. In 12th International Symposium on Static Analysis (Vol. 3672, pp. 268–283). London, United Kingdom: Springer. https://doi.org/10.1007/11547662_19
Podelski, Andreas, and Thomas Wies. “Boolean Heaps.” In 12th International Symposium on Static Analysis, 3672:268–83. Springer, 2005. https://doi.org/10.1007/11547662_19.
A. Podelski and T. Wies, “Boolean Heaps,” in 12th International Symposium on Static Analysis, London, United Kingdom, 2005, vol. 3672, pp. 268–283.
Podelski A, Wies T. 2005. Boolean Heaps. 12th International Symposium on Static Analysis. SAS: Static Analysis Symposium, LNCS, vol. 3672, 268–283.
Podelski, Andreas, and Thomas Wies. “Boolean Heaps.” 12th International Symposium on Static Analysis, vol. 3672, Springer, 2005, pp. 268–83, doi:10.1007/11547662_19.

Export

Marked Publications

Open Data ISTA Research Explorer

Search this title in

Google Scholar
ISBN Search