Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard
Logic in Computer Science
2020-04-17 v1
Abstract
The entailment between separation logic formulae with inductive predicates, also known as symbolic heaps, has been shown to be decidable for a large class of inductive definitions. Recently, a 2-EXPTIME algorithm was proposed and an EXPTIME-hard bound was established; however no precise lower bound is known. In this paper, we show that deciding entailment between predicate atoms is 2-EXPTIME-hard. The proof is based on a reduction from the membership problem for exponential-space bounded alternating Turing machines.
Cite
@article{arxiv.2004.07578,
title = {Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard},
author = {Mnacho Echenim and Radu Iosif and Nicolas Peltier},
journal= {arXiv preprint arXiv:2004.07578},
year = {2020}
}