Compositional Entailment Checking for a Fragment of Separation Logic - Archive ouverte HAL
Article Dans Une Revue Formal Methods in System Design Année : 2017

Compositional Entailment Checking for a Fragment of Separation Logic

Résumé

We present a decision procedure for checking entailment between separation logic formulas with inductive predicates specifying complex data structures corresponding to finite nesting of various kinds of singly linked lists: acyclic or cyclic, nested lists, skip lists, etc. The decision procedure is compositional in the sense that it reduces the problem of checking entailment between two arbitrary formulas to the problem of checking entailment between a formula and an atom. Subsequently, in case the atom is a predicate, we reduce the entailment to testing membership of a tree derived from the formula in the language of a tree automaton derived from the predicate. The procedure is later also extended to doubly linked lists. We implemented this decision procedure and tested it successfully on verification conditions obtained from programs using both singly and doubly linked nested lists as well as skip lists.
Fichier principal
Vignette du fichier
main.pdf (506.36 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01937818 , version 1 (28-11-2018)

Identifiants

Citer

Constantin Enea, Ondřej Lengál, Sighireanu Mihaela, Tomáš · Vojnar. Compositional Entailment Checking for a Fragment of Separation Logic. Formal Methods in System Design, 2017, 51 (3), pp.575-607. ⟨10.1007/s10703-017-0289-4⟩. ⟨hal-01937818⟩
36 Consultations
188 Téléchargements

Altmetric

Partager

More