Abstract
Spen is a solver for a fragment of separation logic (SL) with inductively-defined predicates covering both (nested) list structures as well as various kinds of trees, possibly extended with data. The main functionalities of Spen are deciding the satisfiability of a formula and the validity of an entailment between two formulas, which are essential for verification of heap manipulating programs. The solver also provides models for satisfiable formulas and diagnosis for invalid entailments. Spen combines several concepts in a modular way, such as boolean abstractions of SL formulas, SAT and SMT solving, and tree automata membership testing. The solver has been successfully applied to a rather large benchmark of various problems issued from program verification tools.
Cite
CITATION STYLE
Enea, C., Lengál, O., Sighireanu, M., & Vojnar, T. (2017). SPEN: A solver for separation logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10227 LNCS, pp. 302–309). Springer Verlag. https://doi.org/10.1007/978-3-319-57288-8_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
