Work

The Logic of Separation Logic: Models and Proofs

Year: 2023

Type: conference-paper

Abstract: The standard semantics of separation logic is restricted to finite heaps. This restriction already gives rise to a logic which does not satisfy compactness, hence it does not allow for an effective, sound and complete axiomatization. In this paper we therefore study both the general model theory and proof theory of the separation logic of finite and infinite heaps over arbitrary (first-order) models. We show that we can express in the resulting logic finiteness of the models and the existence of both countably infinite and uncountable models. We further show that a sound and complete sequent calculus still can be obtained by restricting the second-order quantification over heaps to first-order definable heaps.

Source: Lecture notes in computer science

DOI: 10.1007/978-3-031-43513-3_22

Authors: Frank S. de Boer, Hans-Dieter A. Hiep, Stijn de Gouw

Institutions: Leiden University, Centrum Wiskunde & Informatica, Open University of the Netherlands

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $5,392

OpenAlex ID: W4386754710