Heap-Dependent Expressions in Separation Logic - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Heap-Dependent Expressions in Separation Logic

Résumé

Separation logic is a popular specification language for imperative programs where the heap can only be mentioned through points-to assertions. However, separation logic's take on assertions does not match well with the classical view of assertions as boolean, side effect-free, potentially heap-dependent expressions from the host programming language familiar to many developers. In this paper, we propose a variant of separation logic where side effect-free expressions from the host programming language, such as pointer dereferences and invocations of pure methods, can be used in assertions. We modify the symbolic execution-based verification algorithm used in Smallfoot to support mechanized checking of our variant of separation logic. We have implemented this algorithm in a tool and used the tool to verify some interesting programming patterns.
Fichier principal
Vignette du fichier
61170168.pdf (219.65 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01055155 , version 1 (11-08-2014)

Licence

Identifiants

Citer

Jan Smans, Bart Jacobs, Frank Piessens. Heap-Dependent Expressions in Separation Logic. Joint 12th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 30th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2010, Amsterdam, Netherlands. pp.170-185, ⟨10.1007/978-3-642-13464-7_14⟩. ⟨hal-01055155⟩
117 Consultations
173 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More