Publication Details

SPEN: A Solver for Separation Logic

LENGÁL, O.; VOJNAR, T.; ENEA, C.; SIGHIREANU, M. SPEN: A Solver for Separation Logic. In Proceedings of NFM'17. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2017. p. 302-309. ISBN: 978-3-319-57287-1.
Czech title
SPEN: Solver pro separační logiku
Type
conference paper
Language
English
Authors
Lengál Ondřej, Ing., Ph.D. (DITS)
Vojnar Tomáš, prof. Ing., Ph.D. (DITS)
Enea Constantin (FIT)
Sighireanu Mihaela
Keywords

separation logic entailment checking satisfiability checking SMT solving SAT solving tree automata tool support

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 ratherlarge benchmark of various problems issued from program verification too.

Published
2017
Pages
302–309
Proceedings
Proceedings of NFM'17
Series
Lecture Notes in Computer Science
Volume
10227
ISBN
978-3-319-57287-1
Publisher
Springer Verlag
Place
Heidelberg
DOI
10.1007/978-3-319-57288-8_22
UT WoS
000890067500022
EID Scopus
2-s2.0-85018662996
BibTeX 
@inproceedings{BUT135904,
  author="Ondřej {Lengál} and Tomáš {Vojnar} and Constantin {Enea} and Mihaela {Sighireanu}",
  title="SPEN: A Solver for Separation Logic",
  booktitle="Proceedings of NFM'17",
  year="2017",
  series="Lecture Notes in Computer Science",
  volume="10227",
  pages="302--309",
  publisher="Springer Verlag",
  address="Heidelberg",
  doi="10.1007/978-3-319-57288-8\{_}22",
  isbn="978-3-319-57287-1",
  url="https://www.fit.vut.cz/research/publication/11366/"
}
Back to top