AbstractThe entailment problem $$\upvarphi \models \uppsi $$
φ
⊧
ψ
in Separation Logic [12, 15], between separated conjunctions of equational ($$x \approx y$$
x
≈
y
and $$x \not \approx y$$
x
≉
y
), spatial ($$x \mapsto (y_1,\ldots ,y_\upkappa )$$
x
↦
(
y
1
,
…
,
y
κ
)
) and predicate ($$p(x_1,\ldots ,x_n)$$
p
(
x
1
,
…
,
x
n
)
) atoms, interpreted by a finite set of inductive rules, is undecidable in general. Certain restrictions on the set of inductive definitions lead to decidable classes of entailment problems. Currently, there are two such decidable classes, based on two restrictions, called establishment [10, 13, 14] and restrictedness [8], respectively. Both classes are shown to be in $$\mathsf {2\text {EXPTIME}}$$
2
EXPTIME
by the independent proofs from [14] and [8], respectively, and a many-one reduction of established to restricted entailment problems has been given [8]. In this paper, we strictly generalize the restricted class, by distinguishing the conditions that apply only to the left- ($$\upvarphi $$
φ
) and the right- ($$\uppsi $$
ψ
) hand side of entailments, respectively. We provide a many-one reduction of this generalized class, called safe, to the established class. Together with the reduction of established to restricted entailment problems, this new reduction closes the loop and shows that the three classes of entailment problems (respectively established, restricted and safe) form a single, unified, $$\mathsf {2\text {EXPTIME}}$$
2
EXPTIME
-complete class.
Effective Entailment Checking for Separation Logic with Inductive Definitions
