Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules
Résumé
Entailment is undecidable in general for Separation (SL) Logic formulae with inductive 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.
Domaines
Logique en informatique [cs.LO]
Origine : Fichiers produits par l'(les) auteur(s)