论文标题
带有归纳定义的分离逻辑的零件检查是2-隔离的困难
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard
论文作者
论文摘要
与归纳谓词（也称为象征性堆）之间的分离逻辑公式之间的需要证明，对于大量的归纳定义是可决定的。最近，提出了一种2-隔离算法，并建立了一个限制算法。但是，尚无确切的下限。在本文中，我们表明，决定谓词原子之间的需要是2-脱皮的。该证明是基于从成员问题中减少指数空间有限交替的图灵机。
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.
