A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic

Abstract Separation logic is a powerful program logic for the static modular verification of imperative programs. However, dynamic checking of separation logic contracts on the boundaries between verified and untrusted modules is hard because it requires one to enforce (among other things) that outcalls from a verified to an untrusted module do not access memory resources currently owned by the verified module. This paper proposes an approach to dynamic contract checking by relying on support for capabilities, a well-studied form of unforgeable memory pointers that enables fine-grained, efficient memory access control. More specifically, we rely on a form of capabilities called linear capabilities for which the hardware enforces that they cannot be copied. We formalize our approach as a fully abstract compiler from a statically verified source language to an unverified target language with support for linear capabilities. The key insight behind our compiler is that memory resources described by spatial separation logic predicates can be represented at run time by linear capabilities. The compiler is separation-logic-proof-directed: it uses the separation logic proof of the source program to determine how memory accesses in the source program should be compiled to linear capability accesses in the target program. The full abstraction property of the compiler essentially guarantees that compiled verified modules can interact with untrusted target language modules as if they were compiled from verified code as well. This article is an extended version of one that was presented at ICFP 2019 (Van Strydonck et al., 2019).

Download Full-text

Cosmo: a concurrent separation logic for multicore OCaml

Proceedings of the ACM on Programming Languages ◽

10.1145/3408978 ◽

2020 ◽

Vol 4 (ICFP) ◽

pp. 1-29

Author(s):

Glen Mével ◽

Jacques-Henri Jourdan ◽

François Pottier

Keyword(s):

Separation Logic ◽

Concurrent Separation Logic

Download Full-text

Separation logic for sequential programs (functional pearl)

Proceedings of the ACM on Programming Languages ◽

10.1145/3408998 ◽

2020 ◽

Vol 4 (ICFP) ◽

pp. 1-34

Author(s):

Arthur Charguéraud

Keyword(s):

Separation Logic ◽

Sequential Programs

Download Full-text

An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,×†

Fundamenta Informaticae ◽

10.3233/fi-2021-2009 ◽

2021 ◽

Vol 178 (4) ◽

pp. 315-346

Author(s):

Domenico Cantone ◽

Marianna Nicolosi-Asmundo ◽

Daniele Francesco Santamaria

Keyword(s):

Semantic Web ◽

Set Theory ◽

Description Logic ◽

Knowledge Bases ◽

Query Answering ◽

Conjunctive Query ◽

Classification Problems ◽

Previous Version ◽

Decidable Fragment ◽

Stratified Set

We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic 𝒟ℒ〈4LQSR,×〉(D) (𝒟ℒD4,×, for short). Our application solves the main TBox and ABox reasoning problems for 𝒟ℒD4,×. In particular, it solves the consistency and the classification problems for 𝒟ℒD4,×-knowledge bases represented in set-theoretic terms, and a generalization of the Conjunctive Query Answering problem in which conjunctive queries with variables of three sorts are admitted. The reasoner, which extends and improves a previous version, is implemented in C++. It supports 𝒟ℒD4,×-knowledge bases serialized in the OWL/XML format and it admits also rules expressed in SWRL (Semantic Web Rule Language).

Download Full-text