Detail publikačního výsledku

Compositional Entailment Checking for a Fragment of Separation Logic

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

Originální název

Compositional Entailment Checking for a Fragment of Separation Logic

Anglický název

Compositional Entailment Checking for a Fragment of Separation Logic

Druh

Článek WoS

Originální abstrakt

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.

Anglický abstrakt

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.

Klíčová slova

program analysis, separation logic, decision procedure, tree automata

Klíčová slova v angličtině

program analysis, separation logic, decision procedure, tree automata

Autoři

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

Rok RIV

2018

Vydáno

03.08.2017

ISSN

0925-9856

Periodikum

FORMAL METHODS IN SYSTEM DESIGN

Svazek

2017

Číslo

51

Stát

Spojené státy americké

Strany od

575

Strany do

607

Strany počet

33

URL

https://www.fit.vut.cz/research/publication/11504/

Plný text v Digitální knihovně

http://hdl.handle.net/

BibTex

@article{BUT144468,
  author="Ondřej {Lengál} and Tomáš {Vojnar} and Constantin {Enea} and Mihaela {Sighireanu}",
  title="Compositional Entailment Checking for a Fragment of Separation Logic",
  journal="FORMAL METHODS IN SYSTEM DESIGN",
  year="2017",
  volume="2017",
  number="51",
  pages="575--607",
  doi="10.1007/s10703-017-0289-4",
  issn="0925-9856",
  url="https://www.fit.vut.cz/research/publication/11504/"
}

Dokumenty

s10703-017-0289-4