Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules

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 conditi...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters Vol. 173
Main Authors: Echenim, Mnacho, Iosif, Radu, Peltier, Nicolas
Format: Journal Article
Language:English
Published: Elsevier 01.01.2022
Subjects:
Computer Science
Logic in Computer Science
Decidability
Inductive Definition
Separation Logic
ISSN:0020-0190
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0020-0190
DOI:10.1016/j.ipl.2021.106169