Analysis and verification techniques for heap-manipulating programs are crucial to avoid and find errors, to optimize implementations, and to verify properties.

Most of today's software is written in procedural or object-oriented programming languages. Many of these programs make use of heap-allocated data. This is.

Our proposal uses reflection to enable equational reasoning about heaps, and Hoare triples with binary postconditions to fur- ther facilitate it. We apply these ...

Our proposal uses reflection to enable equational reasoning about heaps, and Hoare triples with binary postconditions to fur- ther facilitate it. We apply these ...

These are all successful examples of verification/analysis of heap- manipulating programs, esp. those processing pointer-based shared mutable data.

In this work, we address this challenge in the context of the synthesis and verification of heap-manipulating programs. We present a technique for principled ...

Programs that manipulate dynamic heap objects are difficult to analyze due to issues like aliasing. Lazy initialization algorithm enables the classical ...