| Summary: | Modal separation logics are formalisms that combine modal operators to reason locally, with separating connectives that allow to perform global updates on the models. In this work, we design Hilbert-style proof systems for the modal separation logics MSL(∗,⟨≠⟩) and MSL(∗,◊), where ∗ is the separating conjunction, ◊ is the standard modal operator and ⟨≠⟩ is the difference modality. The calculi only use the logical languages at hand (no external features such as labels) and can be divided in two main parts. First, normal forms for formulae are designed and the calculi allow to transform every formula into a formula in normal form. Second, another part of the calculi is dedicated to the axiomatization for formulae in normal form, which may still require non-trivial developments but is more manageable.
|
|---|