Conference paper

IOSIF Radu, ROGALEWICZ Adam and VOJNAR Tomáš. Deciding Entailments in Inductive Separation Logic with Tree Automata. In: Proceedings of ATVA'14. Heidelberg: Springer Verlag, 2014, pp. 201-218. ISBN 978-3-319-11935-9. Available from:
Publication language:english
Original title:Deciding Entailments in Inductive Separation Logic with Tree Automata
Title (cs):Rozhodovací procedura pro separační logiku s induktivními definicemi založená na stromových automatech
Proceedings:Proceedings of ATVA'14
Conference:12th International Symposium on Automated Technology for Verification and Analysis
Series:LNCS 8837
Place:Heidelberg, DE
Publisher:Springer Verlag
Separation logic, entailment, decision procedure, tree automata, EXPTIME-complete
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.
   author = {Radu Iosif and Adam Rogalewicz and
	Tom{\'{a}}{\v{s}} Vojnar},
   title = {Deciding Entailments in Inductive Separation Logic
	with Tree Automata},
   pages = {201--218},
   booktitle = {Proceedings of ATVA'14},
   series = {LNCS 8837},
   year = 2014,
   location = {Heidelberg, DE},
   publisher = {Springer Verlag},
   ISBN = {978-3-319-11935-9},
   language = {english},
   url = {}

Your IPv4 address:
Switch to https