Deciding Boolean Separation Logic via Small Models

We present a novel decision procedure for a fragment of separation logic with arbitrary nesting of conjunctions, disjunctions and guarded negations; and the most common variants of linked lists. Our method is based on model-based translation to SMT for which we introduce several optimisations – the most important of them is based on bounding the size of predicates in models which leads to their efficient translation. In the experimental evaluation, we show that on the frequently used symbolic heap fragment, our decision procedure is competitive with other approaches, and outside symbolic heap fragment, it can outperform them.