Name
Abstract | ||
|---|---|---|
We address the entailment problem for separation logic with symbolic heaps admitting list pred- icates and permissions for memory cells that are essential to express ownership of a heap region. In the permission-free case, the entailment problem is known to be in P. Herein, we design new decision procedures for solving the satisfiability and entailment problems that are parameterised by the permission theories. This permits the use of solvers dealing with the permission theory at hand, independently of the shape analysis. We also show that the entailment problem without list predicates is coNP-complete for several permission models, such as counting permissions and binary tree shares but the problem is in P for fractional permissions. Furthermore, when list predicates are added, we prove that the entailment problem is coNP-complete when the entail- ment problem for permission formulae is in coNP, assuming the write permission can be split into as many read permissions as desired. Finally, we show that the entailment problem for any Boolean permission model with infinite width is coNP-complete. |
Year | Venue | Field |
|---|---|---|
2017 | FSTTCS | Permission,Discrete mathematics,Logical consequence,Separation logic,Algebra,Modulo,Computer science,Satisfiability,Binary tree,Heap (data structure),Predicate (grammar) |
DocType | Citations | PageRank |
Conference | 2 | 0.38 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Demri | 1 | 22 | 1.80 |
| Étienne Lozes | 2 | 121 | 14.32 |
| Denis Lugiez | 3 | 409 | 27.61 |