The SAT-based Approach to Separation Logic

  • Authors:

  • Alessandro Armando;Claudio Castellini;Enrico Giunchiglia;Marco Maratea

  • Affiliations:

  • DIST, University of Geneva, Geneva, Italy 13-16145;DIST, University of Geneva, Geneva, Italy 13-16145;DIST, University of Geneva, Geneva, Italy 13-16145;DIST, University of Geneva, Geneva, Italy 13-16145

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The SAT-based approach to the decision problem for expressive, decidable, quantifier-free first-order theories has been investigated with remarkable results at least since 1993. One such theory, successfully employed in the formal verification of complex, infinite state systems, is Separation Logic (SL), which combines Boolean logic with arithmetic constraints of the form x 驴 y 驴 c, where 驴 is 驴, , 驴, =, or 驴. The SAT-based approach to SL was first proposed and implemented in 1999: the results in terms of performance were good, and since then a number of other systems for SL have appeared. In this paper we focus on the problem of building efficient SAT-based decision procedures for SL. We present the basic procedure and four optimizations that improve dramatically its effectiveness in most cases: (a) IS 2 preprocessing, (b) early pruning, (c) model reduction, and (d) best reason detection. For each technique we give an example of how it might improve the performance. Furthermore, for the first three techniques, we give a pseudo-code representation and formally state the soundness and completeness of the resulting optimized procedure. We also show how it is possible to check the satisfiability of valuations involving constraints of the form x 驴 y c using the Bellman---Ford algorithm. Lastly, we present an extensive comparative experimental analysis, showing that our solver TSAT++, built along the lines described in this paper, is currently the state of the art on various classes of problems, including randomly generated, hand-made, and real-world instances.