The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates
From MaRDI portal
Publication:5121270
DOI10.1145/3380809zbMath1446.03064OpenAlexW2992863903MaRDI QIDQ5121270
Nicolas Peltier, Mnacho Echenim, Radu Iosif
Publication date: 11 September 2020
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3380809
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
On Composing Finite Forests with Modal Logics ⋮ Foundations for entailment checking in quantitative separation logic ⋮ Unifying decidable entailments in separation logic with inductive definitions ⋮ A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions
This page was built for publication: The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates
