Automatic assume/guarantee reasoning for heap-manipulating programs: Ongoing work

Greta Yorsh, Alexey Skidanov, Thomas Reps, Mooly Sagiv

Research output: Contribution to journalConference articlepeer-review


Assume/Guarantee (A/G) reasoning for heap-manipulating programs is challenging because the heap can be mutated in an arbitrary way by procedure calls. Moreover, specifying the potential side-effects of a procedure is non-trivial. We report on an on-going effort to reduce the burden of A/G reasoning for heap-manipulating programs by automatically generating post-conditions and estimating side-effects of non-recursive procedures. Our method is sound. It combines the use of theorem provers and abstract- interpretation algorithms.

Original languageEnglish
Pages (from-to)125-138
Number of pages14
JournalElectronic Notes in Theoretical Computer Science
StatePublished - 24 May 2005
EventProceedings of the First International Workshop on Abstract Interpretation of Object-oriented Languages (AIOOL 2005) -
Duration: 21 Jan 200521 Jan 2005


  • Abstract interpretation
  • Assume-guarantee reasoning
  • Mod-clauses
  • Shape analysis
  • Side-effect
  • Theorem prover


Dive into the research topics of 'Automatic assume/guarantee reasoning for heap-manipulating programs: Ongoing work'. Together they form a unique fingerprint.

Cite this