Automation of separation logic using auto2.
Bohua Zhan · arXiv (Cornell University) · 2016
We present a new system of automation for separation logic in the interactive theorem prover Isabelle. The system is based on the recently developed auto2 prover, and follows a natural, saturation-based approach to reasoning about imperative programs. In addition to standard examples on linked lists and binary search trees, we apply the automation to red-black trees and indexed priority queues, showing that it provides a high degree of automation even on the more complicated data structures.