[{"article_processing_charge":"No","date_created":"2018-12-11T12:08:29Z","quality_controlled":"1","publication_status":"published","volume":3672,"language":[{"iso":"eng"}],"page":"268-283","month":"01","type":"conference","doi":"10.1007/11547662_19","title":"Boolean Heaps","publication_identifier":{"isbn":["978-3-540-28584-7"]},"extern":"1","scopus_import":"1","conference":{"start_date":"2005-09-07","name":"SAS: Static Analysis Symposium","end_date":"2005-09-09","location":"London, United Kingdom"},"author":[{"full_name":"Podelski, Andreas","last_name":"Podelski","first_name":"Andreas"},{"last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","first_name":"Thomas"}],"publication":"12th International Symposium on Static Analysis","intvolume":"      3672","oa_version":"None","status":"public","_id":"4367","publisher":"Springer","citation":{"mla":"Podelski, Andreas, and Thomas Wies. “Boolean Heaps.” <i>12th International Symposium on Static Analysis</i>, vol. 3672, Springer, 2005, pp. 268–83, doi:<a href=\"https://doi.org/10.1007/11547662_19\">10.1007/11547662_19</a>.","short":"A. Podelski, T. Wies, in:, 12th International Symposium on Static Analysis, Springer, 2005, pp. 268–283.","chicago":"Podelski, Andreas, and Thomas Wies. “Boolean Heaps.” In <i>12th International Symposium on Static Analysis</i>, 3672:268–83. Springer, 2005. <a href=\"https://doi.org/10.1007/11547662_19\">https://doi.org/10.1007/11547662_19</a>.","ieee":"A. Podelski and T. Wies, “Boolean Heaps,” in <i>12th International Symposium on Static Analysis</i>, London, United Kingdom, 2005, vol. 3672, pp. 268–283.","apa":"Podelski, A., &#38; Wies, T. (2005). Boolean Heaps. In <i>12th International Symposium on Static Analysis</i> (Vol. 3672, pp. 268–283). London, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/11547662_19\">https://doi.org/10.1007/11547662_19</a>","ama":"Podelski A, Wies T. Boolean Heaps. In: <i>12th International Symposium on Static Analysis</i>. Vol 3672. Springer; 2005:268-283. doi:<a href=\"https://doi.org/10.1007/11547662_19\">10.1007/11547662_19</a>","ista":"Podelski A, Wies T. 2005. Boolean Heaps. 12th International Symposium on Static Analysis. SAS: Static Analysis Symposium, LNCS, vol. 3672, 268–283."},"year":"2005","day":"01","fulldoi":"https://doi.org/10.1007/11547662_19","date_published":"2005-01-01T00:00:00Z","date_updated":"2025-07-01T12:10:29Z","alternative_title":["LNCS"],"publist_id":"1092","abstract":[{"lang":"eng","text":"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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}]