1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.LO2018
On the Complexity of Pointer Arithmetic in Separation Logic (an extended version)
James Brotherston, Max Kanovich
We investigate the complexity consequences of adding pointer arithmetic to separation logic. Specifically, we study extensions of the points-to fragment of symbolic-heap separation…
cs.LO2017★ 1 cited
Size Relationships in Abstract Cyclic Entailment Systems
Reuben N. S. Rowe, James Brotherston
A cyclic proof system generalises the standard notion of a proof as a finite tree of locally sound inferences by allowing proof objects to be potentially infinite. Regular infinite…