Separation Predicates: a Taste of Separation Logic in First-Order Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Separation Predicates: a Taste of Separation Logic in First-Order Logic

Abstract

This paper introduces separation predicates, a technique to reuse some ideas from separation logic in the framework of program veri cation using a traditional rst-order logic. The purpose is to bene t from existing speci cation languages, veri cation condition generators, and automated theorem provers. Separation predicates are automatically derived from user-de ned inductive predicates. We illustrate this idea on a non-trivial case study, namely the composite pattern, which is speci- ed in C/ACSL and veri ed in a fully automatic way using SMT solvers Alt-Ergo, CVC3, and Z3.
Fichier principal
Vignette du fichier
bobot12icfem.pdf (186.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00825088 , version 1 (22-05-2013)

Identifiers

Cite

François Bobot, Jean-Christophe Filliâtre. Separation Predicates: a Taste of Separation Logic in First-Order Logic. 14th International Conference on Formal Ingineering Methods (ICFEM), Nov 2012, Kyoto, Japan. pp.167-181, ⟨10.1007/978-3-642-34281-3_14⟩. ⟨hal-00825088⟩
228 View
258 Download

Altmetric

Share

Gmail Facebook X LinkedIn More