Heap Assumptions on Demand

Termination of a heap-manipulating program generally depends on preconditions that express heap assumptions (i.e., assertions describing reachability, aliasing, separation and sharing in the heap). We present an algorithm for the inference of such preconditions. The algorithm exploits a unique interween counterexample-producing abstract termination checker and shape analysis. The shape analysis produces heap assumptions on demand to eliminate xamples, i.e., non-terminating abstract computations. The experiments with our prototype implementation indicate its practical potential.

• Type: Conference
• Year: 2008
• Where: CAV
• Authors: Andreas Podelski, Andrey Rybalchenko, Thomas Wies
• Keywords: Assertions Describing Reachability, CAV 2008, Hardware, Heap Assumptions, Shape Analysis