On the Expressive Completeness of Bernays-Sch\"onfinkel-Ramsey Separation Logic

16 Feb 2018 Echenim Mnacho Iosif Radu Peltier Nicolas

This paper investigates the satisfiability problem for Separation Logic, with unrestricted nesting of separating conjunctions and implications, for prenex formulae with quantifier prefix in the language $\exists^*\forall^*$, in the cases where the universe of possible locations is either countably infinite or finite. In analogy with first-order logic with uninterpreted predicates and equality, we call this fragment Bernays-Sch\"onfinkel-Ramsey Separation Logic [BSR(SLk)]... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • LOGIC IN COMPUTER SCIENCE