Entailment is Undecidable for Symbolic Heap Separation Logic Formulae with Non-Established Inductive Rules
Résumé
Entailment is undecidable in general for Separation (SL) Logic formulae with in-ductive definitions, but it has been shown to be decidable [1] if the inductive rules satisfy three conditions, namely progress, connectivity and establishment. We show that entailment is undecidable if the latter condition is dropped, thus drawing a much clearer frontier for (un)decidability.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...