The Lower Bound of Decidable Entailments in Separation Logic with Inductive Definitions - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

The Lower Bound of Decidable Entailments in Separation Logic with Inductive Definitions

Mnacho Echenim
Radu Iosif
  • Function : Author

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 [4]. Recently, a 2EXPTIME algorithm has been proposed [7], however no precise lower bound is known (although a EXPTIME-hard bound for this problem has been established in [5]). In this paper, we show that deciding entailment between predicate atoms is 2EXPTIME-hard. The proof is based on a reduction from the membership problem for exponential-space bounded alternating Turing machines [3].
Fichier principal
Vignette du fichier
ADSL.pdf (190.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02388028 , version 1 (30-11-2019)

Identifiers

  • HAL Id : hal-02388028 , version 1

Cite

Mnacho Echenim, Radu Iosif, Nicolas Peltier. The Lower Bound of Decidable Entailments in Separation Logic with Inductive Definitions. ADSL 2020 - Workshop on Automated Deduction in Separation Logic, 2020, New Orleans, United States. ⟨hal-02388028⟩
160 View
36 Download

Share

Gmail Facebook X LinkedIn More