Using stereotypes to verify complex heap structures in regional logic; ; ETH Technical Report;

Verification of complex heap structures is a challenging task. Typically, a description of heap structures requires intensive usage of transitive closure or similar constructions, e.g. recursive functions or inductive definitions. Such constructions are expressive enough to make writing of heap specifications fast and natural. On the other hand such specifications have several disadvantages: