Name
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. 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. |
Year | Venue | DocType |
|---|---|---|
2020 | LPAR | Conference |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mnacho Echenim | 1 | 95 | 15.75 |
| Radu Iosif | 2 | 483 | 42.44 |
| Nicolas Peltier | 3 | 50 | 11.84 |