Publication detail

Deciding Entailments in Inductive Separation Logic with Tree Automata

ROGALEWICZ, A. VOJNAR, T. IOSIF, R.

Original Title

Deciding Entailments in Inductive Separation Logic with Tree Automata

Type

conference paper

Language

English

Original Abstract

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.

Keywords

Separation logic, entailment, decision procedure, tree automata, EXPTIME-complete

Authors

ROGALEWICZ, A.; VOJNAR, T.; IOSIF, R.

RIV year

2014

Released

3. 11. 2014

Publisher

Springer Verlag

Location

Heidelberg

ISBN

978-3-319-11935-9

Book

Proceedings of ATVA'14

Edition

Lecture Notes in Computer Science

Pages from

201

Pages to

218

Pages count

18

URL

http://rd.springer.com/chapter/10.1007%2F978-3-319-11936-6_15

BibTex

@inproceedings{BUT111633,
  author="Adam {Rogalewicz} and Tomáš {Vojnar} and Iosif {Radu}",
  title="Deciding Entailments in Inductive Separation Logic with Tree Automata",
  booktitle="Proceedings of ATVA'14",
  year="2014",
  series="Lecture Notes in Computer Science",
  volume="8837",
  pages="201--218",
  publisher="Springer Verlag",
  address="Heidelberg",
  isbn="978-3-319-11935-9",
  url="http://rd.springer.com/chapter/10.1007%2F978-3-319-11936-6_15"
}