Detail publikace

Deciding Entailments in Inductive Separation Logic with Tree Automata

Originální název

Deciding Entailments in Inductive Separation Logic with Tree Automata

Anglický název

Deciding Entailments in Inductive Separation Logic with Tree Automata

Jazyk

en

Originální abstrakt

Separation Logic (SL) with inductive definitions is a natural formalism for specifying complex recursive data structures, used in compositional verification of programs manipulating such structures. The key ingredient of any automated verification procedure based on SL is the decidability of the entailment problem. In this work, we reduce the entailment problem for a non-trivial subset of SL describing trees (and beyond) to the language inclusion of tree automata (TA). Our reduction provides tight complexity bounds for the problem and shows that entailment in our fragment is EXPTIME-complete. For practical purposes, we leverage from recent advances in automata theory, such as inclusion checking for non-deterministic TA avoiding explicit determinization. We implemented our method and present promising preliminary experimental results.

Anglický abstrakt

Separation Logic (SL) with inductive definitions is a natural formalism for specifying complex recursive data structures, used in compositional verification of programs manipulating such structures. The key ingredient of any automated verification procedure based on SL is the decidability of the entailment problem. In this work, we reduce the entailment problem for a non-trivial subset of SL describing trees (and beyond) to the language inclusion of tree automata (TA). Our reduction provides tight complexity bounds for the problem and shows that entailment in our fragment is EXPTIME-complete. For practical purposes, we leverage from recent advances in automata theory, such as inclusion checking for non-deterministic TA avoiding explicit determinization. We implemented our method and present promising preliminary experimental results.

BibTex


@inproceedings{BUT111633,
  author="Adam {Rogalewicz} and Tomáš {Vojnar} and Iosif {Radu}",
  title="Deciding Entailments in Inductive Separation Logic with Tree Automata",
  annote="Separation Logic (SL) with inductive definitions is a natural
formalism for specifying complex recursive data structures, used in
compositional verification of programs manipulating such structures. The key
ingredient of any automated verification procedure based on SL is the
decidability of the entailment problem. In this work, we reduce the entailment
problem for a non-trivial subset of SL describing trees (and beyond) to the
language inclusion of tree automata (TA). Our reduction provides tight
complexity bounds for the problem and shows that entailment in our fragment is
EXPTIME-complete. For practical purposes, we leverage from recent advances in
automata theory, such as inclusion checking for non-deterministic TA avoiding
explicit determinization. We implemented our method and present promising
preliminary experimental results.",
  address="Springer Verlag",
  booktitle="Proceedings of ATVA'14",
  chapter="111633",
  edition="Lecture Notes in Computer Science",
  howpublished="print",
  institution="Springer Verlag",
  year="2014",
  month="november",
  pages="201--218",
  publisher="Springer Verlag",
  type="conference paper"
}