HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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

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].
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download

Contributor : Radu Iosif Connect in order to contact the contributor
Submitted on : Saturday, November 30, 2019 - 8:20:16 PM
Last modification on : Wednesday, November 3, 2021 - 6:47:01 AM
Long-term archiving on: : Sunday, March 1, 2020 - 2:17:17 PM


Files produced by the author(s)


  • HAL Id : hal-02388028, version 1



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⟩



Record views


Files downloads