Conference paper

ENEA Constantin, LENGÁL Ondřej, SIGHIREANU Mihaela and VOJNAR Tomáš. SPEN: A Solver for Separation Logic. In: Proceedings of NFM'17. Heidelberg: Springer Verlag, 2017, pp. 302-309. ISBN 978-3-319-57287-1.
Publication language:english
Original title:SPEN: A Solver for Separation Logic
Title (cs):SPEN: Solver pro separační logiku
Proceedings:Proceedings of NFM'17
Conference:NASA Formal Methods 2017
Series:LNCS 10227
Place:Heidelberg, DE
Publisher:Springer Verlag

separation logic
entailment checking
satisfiability checking
SMT solving
SAT solving
tree automata
tool support
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 ratherlarge benchmark of various problems issued from program verification too.
   author = {Constantin Enea and Ond{\v{r}}ej Leng{\'{a}}l and
	Mihaela Sighireanu and Tom{\'{a}}{\v{s}} Vojnar},
   title = {SPEN: A Solver for Separation Logic},
   pages = {302--309},
   booktitle = {Proceedings of NFM'17},
   series = {LNCS 10227},
   year = 2017,
   location = {Heidelberg, DE},
   publisher = {Springer Verlag},
   ISBN = {978-3-319-57287-1},
   doi = {10.1007/978-3-319-57288-8_22},
   language = {english},
   url = {}

Your IPv4 address: