Labelled Cyclic Proofs for Separation Logic - Université de Lorraine Access content directly
Conference Papers Year : 2018

Labelled Cyclic Proofs for Separation Logic

Didier Galmiche
Daniel Méry

Abstract

Separation Logic (SL) is a logical formalism for reasoning about programs that use pointers to mutate data structures. SL has proven itself successful in the field of program verification over the past fifteen years as an assertion language to state properties about memory heaps using Hoare triples. Since the full logic is not recursively enumerable, most of the proof-systems and verification tools for SL focus on the decidable but rather restricted symbolic heaps fragment. Moreover, recent proof-systems that go beyond symbolic heaps allow either the full set of connectives, or the definition of arbitrary predicates, but not both. In this work, we present a labelled proof-system, called GMSL, that allows both the definition of arbitrary inductive predicates and the full set of SL connectives.
No file

Dates and versions

hal-02982617 , version 1 (28-10-2020)

Identifiers

  • HAL Id : hal-02982617 , version 1

Cite

Didier Galmiche, Daniel Méry. Labelled Cyclic Proofs for Separation Logic. International Workshop on Automated Deduction for Separation Logics, ADSL 2018, 2018, Oxford, United Kingdom. ⟨hal-02982617⟩
37 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More