An undecidability result for Separation Logic with theory reasoning
Résumé
We show that the entailment problem is undecidable in Separation Logic with inductively defined spatial predicates, for rules satisfying the conditions given in [1], if theory reasoning is considered. The result holds for a wide class of theories, even those with a very low expressive power. For instance it applies to natural numbers with the successor function, or with the usual order relation.
Origine | Fichiers produits par l'(les) auteur(s) |
---|