On Automated Lemma Generation for Separation Logic with Inductive Definitions - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2015

On Automated Lemma Generation for Separation Logic with Inductive Definitions

Résumé

Separation Logic with inductive definitions is a well-known approach for deductive verification of programs that manipulate dynamic data structures. Deciding verification conditions in this context is usually based on user-provided lemmas relating the inductive definitions. We propose a novel approach for generating these lemmas automatically which is based on simple syntactic criteria and deterministic strategies for applying them. Our approach focuses on iterative programs, although it can be applied to recursive programs as well, and specifications that describe not only the shape of the data structures, but also their content or their size. Empirically, we find that our approach is powerful enough to deal with sophisticated benchmarks, e.g., iterative procedures for searching, inserting, or deleting elements in sorted lists, binary search tress, red-black trees, and AVL trees, in a very efficient way.
Fichier principal
Vignette du fichier
main_full.pdf (307.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01175732 , version 1 (20-07-2015)

Licence

CC0 - Transfert dans le Domaine Public

Identifiants

Citer

Constantin Enea, Mihaela Sighireanu, Zhilin Wu. On Automated Lemma Generation for Separation Logic with Inductive Definitions. 2015. ⟨hal-01175732⟩
96 Consultations
133 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More