A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Tableaux and Resource Graphs for Separation Logic
2009
Journal of Logic and Computation
Separation Logic (SL) is often presented as an assertion language for reasoning about mutable data structures. As recent results about verification in SL have mainly been achieved from a model-checking point of view, our aim in this paper is to study Separation Logic from a complementary proof-theoretic perspective in order to provide results about proof-search in SL. We begin our study with a fragment of SL, denoted SLP, where first order quantifiers, variables and equality are removed. We
doi:10.1093/logcom/exn066
fatcat:qj6lwlbf4fatlgpn6h2w7y6nju