SPEN: A Solver for Separation Logic
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F17%3APU123660" target="_blank" >RIV/00216305:26230/17:PU123660 - isvavai.cz</a>
Result on the web
<a href="https://www.fit.vut.cz/research/publication/11366/" target="_blank" >https://www.fit.vut.cz/research/publication/11366/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-57288-8_22" target="_blank" >10.1007/978-3-319-57288-8_22</a>
Alternative languages
Result language
angličtina
Original language name
SPEN: A Solver for Separation Logic
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of NFM'17
ISBN
978-3-319-57287-1
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
302-309
Publisher name
Springer Verlag
Place of publication
Heidelberg
Event location
NASA Ames Research Center Moffett Field, CA, USA
Event date
May 16, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000890067500022