Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard
| Autor: | Nicolas Peltier, Mnacho Echenim, Radu Iosif |
|---|---|
| Přispěvatelé: | Calculs algorithmes programmes et preuves (CAPP), Laboratoire d'Informatique de Grenoble (LIG), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA) |
| Rok vydání: | 2020 |
| Předmět: |
FOS: Computer and information sciences
Discrete mathematics Computer Science - Logic in Computer Science 2-EXPTIME Computer science [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] Separation logic Logical consequence Upper and lower bounds Predicate (grammar) Logic in Computer Science (cs.LO) Decidability Turing machine symbols.namesake TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Computer Science::Logic in Computer Science TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Bounded function symbols Computer Science::Formal Languages and Automata Theory |
| Zdroj: | LPAR LPAR 2020: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning LPAR 2020 LPAR 2020, 2020, Alicante, Spain. ⟨10.1145/3380809⟩ |
| ISSN: | 2398-7340 |
| Popis: | The entailment between separation logic formulæ with inductive predicates, also known as sym- bolic heaps, has been shown to be decidable for a large class of inductive definitions [7]. Recently, a 2-EXPTIME algorithm was proposed [10, 14] and an EXPTIME-hard bound was established in [8]; 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 [5]. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|