The Bernays-Schönfinkel-Ramsey class of separation logic on arbitrary domains

DOI10.1007/978-3-030-17127-8_14OpenAlexW2934959668MaRDI QIDQ2289076FDOQ2289076

Authors: Mnacho Echenim, Radu Iosif, Nicolas Peltier 

Publication date: 28 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17127-8_14

Recommendations

• The Bernays-Schönfinkel-Ramsey class of separation logic with uninterpreted predicates
• Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic
• Prenex separation logic with one selector field
• Separation logic with one quantified variable
• Two-Variable Separation Logic and Its Inner Circle

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited In (6)

• Compositional satisfiability solving in separation logic
• A complete axiomatisation for quantifier-free separation logic
• Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic
• Separation logic and logics with team semantics
• A stone-type duality theorem for separation logic via its underlying bunched logics
• Strong-separation logic

This page was built for publication: The Bernays-Schönfinkel-Ramsey class of separation logic on arbitrary domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289076)