SeLoger: A Tool for Graph-Based Reasoning in Separation Logic
This paper introduces the tool SeLoger, which is a reasoner for satisfiability and entailment in a fragment of separation logic with pointers and linked lists. SeLoger builds upon and extends graph-based algorithms that have recently been introduced in order to settle both decision problems in polynomial time. Running SeLoger on standard benchmarks shows that the tool outperforms current state-of-the-art tools by orders of magnitude.
Unable to display preview. Download preview PDF.
- 4.Ishtiaq, S., O’Hearn, P.: BI as an assertion language for mutable data structures. In: Proceedings of POPL 2001, pp. 14–26. ACM (2001)Google Scholar
- 5.Peréz, J.A.N., Rybalchenko, A.: Separation logic + Superposition calculus = Heap theorem prover. In: Proceedings of PLDI 2011, San Jose, CA, USA. ACM Press (2011)Google Scholar
- 6.Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: Proceedings of LICS 2002. IEEE Computer Society (2002)Google Scholar