Skip to Main content Skip to Navigation
Reports

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

Abstract : 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.
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02951859
Contributor : Radu Iosif <>
Submitted on : Wednesday, September 30, 2020 - 10:57:39 AM
Last modification on : Tuesday, November 24, 2020 - 4:00:16 PM

File

PC_undec.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02951859, version 2

Collections

LIG | CNRS | LARA | UGA

Citation

Mnacho Echenim, Radu Iosif, Nicolas Peltier. Entailment is Undecidable for Symbolic Heap Separation Logic Formulae with Non-Established Inductive Rules. [Research Report] CNRS. 2020. ⟨hal-02951859v2⟩

Share

Metrics

Record views

32

Files downloads

30