Name
Abstract | ||
|---|---|---|
AbstractThe list segment predicate ls used in separation logic for verifying programs with pointers is well suited to express properties on singly-linked lists. We study the effects of adding ls to the full quantifier-free separation logic with the separating conjunction and implication, which is motivated by the recent design of new fragments in which all these ingredients are used indifferently and verification tools start to handle the magic wand connective. This is a very natural extension that has not been studied so far. We show that the restriction without the separating implication can be solved in polynomial space by using an appropriate abstraction for memory states, whereas the full extension is shown undecidable by reduction from first-order separation logic. Many variants of the logic and fragments are also investigated from the computational point of view when ls is added, providing numerous results about adding reachability predicates to quantifier-free separation logic. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1145/3448269 | ACM Transactions on Computational Logic |
Keywords | DocType | Volume |
Separation logic, reachability, decision problems, complexity, quantifier elimination | Journal | 22 |
Issue | ISSN | Citations |
2 | 1529-3785 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stéphane Demri | 1 | 25 | 5.10 |
| Étienne Lozes | 2 | 121 | 14.32 |
| Alessio Mansutti | 3 | 16 | 5.79 |