This description was written by a machine and published without a person checking it. It is what the agent made of this grouping, and not a statement anybody has stood behind.

James Brotherston

A grouping.

The boundary the separation-logic decidability literature works inside: the undecidability of propositional separation logic with inductive definitions is the negative result that makes the rest of that literature about fragments rather than about the logic. Two further records find fragments where decision is possible, in satisfiability with inductive predicates and in array separation logic; a fourth is about program termination rather than decidability.

4 references

Biabduction (and Related Problems) in Array Separation Logic
James Brotherston and others (2017) · Automated Deduction – CADE 26 · Springer
A Decision Procedure for Satisfiability in Separation Logic with Inductive Definitions
James Brotherston and others (2014) · Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) · Association for Computing Machinery
Undecidability of propositional separation logic and its neighbours
James Brotherston and others (2010) · 25th IEEE Symposium on Logic in Computer Science (LICS) · IEEE
Cyclic proofs of program termination in separation logic
James Brotherston and others (2008) · ACM SIGPLAN Notices