Result Details
Compositional Entailment Checking for a Fragment of Separation Logic
Lengál Ondřej, doc. Ing., Ph.D.
Sighireanu Mihaela, prof. Ing., PhD.
Vojnar Tomáš, prof. Ing., Ph.D., DITS (FIT)
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.
program verification, decision procedures, separation logic, tree automata
@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"
}Centrum excelence IT4Innovations, MŠMT, Operační program Výzkum a vývoj pro inovace, ED1.1.00/02.0070, start: 2011-01-01, end: 2015-12-31, completed
Spolehlivost a bezpečnost v IT, BUT, Vnitřní projekty VUT, FIT-S-14-2486, start: 2014-01-01, end: 2016-12-31, completed