Precise and compact modular procedure summaries for heap manipulating programs

Isil Dillig*, Thomas Dillig, Alex Aiken, Mooly Sagiv

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a strictly bottom-up, summary-based, and precise heap analysis targeted for program verification that performs strong updates to heap locations at call sites. We first present a theory of heap decompositions that forms the basis of our approach; we then describe a full analysis algorithm that is fully symbolic and efficient. We demonstrate the precision and scalability of our approach for verification of real C and C++ programs.

Original languageEnglish
Title of host publicationPLDI'11 - Proceedings of the 2011 ACM Conference on Programming Language Design and Implementation
Pages567-577
Number of pages11
DOIs
StatePublished - 2011
Event32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI'11 - San Jose, CA, United States
Duration: 4 Jun 20118 Jun 2011

Publication series

NameProceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Conference

Conference32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI'11
Country/TerritoryUnited States
CitySan Jose, CA
Period4/06/118/06/11

Keywords

  • pointer analysis
  • summary-based analysis

Fingerprint

Dive into the research topics of 'Precise and compact modular procedure summaries for heap manipulating programs'. Together they form a unique fingerprint.

Cite this