Name
Abstract | ||
|---|---|---|
Separation logic (SL) has gained widespread popularity because of its ability to succinctly express complex invariants of a program's heap configurations. Several specialized provers have been developed for decidable SL fragments. However, these provers cannot be easily extended or combined with solvers for other theories that are important in program verification, e.g., linear arithmetic. In this paper, we present a reduction of decidable SL fragments to a decidable first-order theory that fits well into the satisfiability modulo theories (SMT) framework. We show how to use this reduction to automate satisfiability, entailment, frame inference, and abduction problems for separation logic using SMT solvers. Our approach provides a simple method of integrating separation logic into existing verification tools that provide SMT backends, and an elegant way of combining SL fragments with other decidable first-order theories. We implemented this approach in a verification tool and applied it to heap-manipulating programs whose verification involves reasoning in theory combinations. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-39799-8_54 | CAV |
Keywords | Field | DocType |
separation logic,decidable sl fragment,automating separation logic,smt solvers,decidable first-order theory,smt backends,verification tool,sl fragment,decidable sl,program verification,heap-manipulating program | Separation logic,Logical consequence,Programming language,Computer science,Inference,Satisfiability,Algorithm,Heap (data structure),Decidability,Theoretical computer science,Symbolic execution,Satisfiability modulo theories | Conference |
Citations | PageRank | References |
46 | 1.25 | 33 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ruzica Piskac | 1 | 373 | 24.47 |
| Thomas Wies | 2 | 515 | 28.26 |
| Damien Zufferey | 3 | 358 | 22.61 |