Separata: Isabelle tactics for Separation Algebra

We bring the labelled sequent calculus LSPASL for propositional abstract separation logic to Isabelle. The tactics given here are directly applied on an extension of the separation algebra in the AFP. In addition to the cancellative separation algebra, we further consider some useful properties in the heap model of separation logic, such as indivisible unit, disjointness, and cross-split. The tactics are essentially a proof search procedure for the calculus LSPASL. We wrap the tactics in an Isabelle method called separata, and give a few examples of separation logic formulae which are provable by separata.