Satisfiability of compositional separation logic with tree predicates and data constraints
From MaRDI portal
Publication:2405271
DOI10.1007/978-3-319-63046-5_31zbMath1496.03138OpenAlexW2735482485MaRDI QIDQ2405271
Zhaowei Xu, Taolue Chen, Zhilin Wu
Publication date: 22 September 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-63046-5_31
Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Data structures (68P05)
Related Items (5)
A proof procedure for separation logic with inductive definitions and data ⋮ An undecidability result for separation logic with theory reasoning ⋮ Compositional satisfiability solving in separation logic ⋮ Unnamed Item ⋮ Reasoning about block-based cloud storage systems via separation logic
This page was built for publication: Satisfiability of compositional separation logic with tree predicates and data constraints