Detail publikace

Compositional Entailment Checking for a Fragment of Separation Logic

ENEA, C. LENGÁL, O. SIGHIREANU, M. VOJNAR, T.

Originální název

Compositional Entailment Checking for a Fragment of Separation Logic

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

We present a (semi-)decision procedure for checking entailment between separation logic formulas with inductive predicates specifying complex data structures corresponding to finite nesting of various kinds of linked lists: acyclic or cyclic, singly or doubly linked, 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. We implemented this decision procedure and tested it successfully on verification conditions obtained from programs using singly and doubly linked nested lists as well as skip lists.

Klíčová slova

program verification, decision procedures, separation logic, tree automata

Autoři

ENEA, C.; LENGÁL, O.; SIGHIREANU, M.; VOJNAR, T.

Rok RIV

2014

Vydáno

20. 8. 2014

Nakladatel

Springer Verlag

Místo

Heidelberg

ISBN

978-3-319-12735-4

Kniha

Proceedings of APLAS'14

Edice

Lecture Notes in Computer Science

Strany od

314

Strany do

333

Strany počet

19

BibTex

@inproceedings{BUT111608,
  author="Constantin {Enea} and Ondřej {Lengál} and Mihaela {Sighireanu} and Tomáš {Vojnar}",
  title="Compositional Entailment Checking for a Fragment of Separation Logic",
  booktitle="Proceedings of APLAS'14",
  year="2014",
  series="Lecture Notes in Computer Science",
  volume="8858",
  pages="314--333",
  publisher="Springer Verlag",
  address="Heidelberg",
  isbn="978-3-319-12735-4"
}