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.
Max Kanovich
A grouping.
What separation logic can and cannot decide, in joint work with Brotherston and Antonopoulos: the undecidability of propositional separation logic, the mapping of where decidability survives under general inductive predicates, and the extension of bi-abduction to arrays. The undecidability result is the one the rest of that literature works around, and a corpus holding only decision procedures would misrepresent the shape of the field.
3 references
Biabduction (and Related Problems) in Array Separation Logic
James Brotherston and others (2017) · Automated Deduction – CADE 26 · Springer
Foundations for Decision Problems in Separation Logic with General Inductive Predicates
Timos Antonopoulos and others (2014) · Foundations of Software Science and Computation Structures · Springer
Undecidability of propositional separation logic and its neighbours
James Brotherston and others (2010) · 25th IEEE Symposium on Logic in Computer Science (LICS) · IEEE