2014
DOI: 10.1007/978-3-642-54830-7_27
View full text
|
|
Share

Abstract: We establish foundational results on the computational complexity of deciding entailment in Separation Logic with general inductive predicates whose underlying base language allows for pure formulas, pointers and existentially quantified variables. We show that entailment is in general undecidable, and ExpTime-hard in a fragment recently shown to be decidable by Iosif et al. Moreover, entailment in the base language is Π P 2 -complete, the upper bound even holds in the presence of list predicates. We additiona…

Expand abstract

Search citation statements

Order By: Relevance

Citation Types

1
38
0

Paper Sections

0
0
0
0
0

Publication Types

0
0
0
0

Relationship

0
0

Authors

Journals