SPEN: A Solver for Separation Logic - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

SPEN: A Solver for Separation Logic

Résumé

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 au-tomata membership testing. The solver has been successfully applied to a rather large benchmark of various problems issued from program verification tools.
Fichier principal
Vignette du fichier
main.pdf (264.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01936210 , version 1 (27-11-2018)

Identifiants

  • HAL Id : hal-01936210 , version 1

Citer

Constantin Enea, Ondřej Lengál, Mihaela Sighireanu, Tomáš Vojnar. SPEN: A Solver for Separation Logic. 9th NASA Formal Methods Symposium (NFM 2017), May 2017, Moffett Field, United States. ⟨hal-01936210⟩
27 Consultations
112 Téléchargements

Partager

Gmail Facebook X LinkedIn More