A Simple Model of Separation Logic for Higher-order Store

Lars Birkedal; Bernhard Reus; Jan Schwinghammer; Hongseok Yang

A Simple Model of Separation Logic for Higher-order Store

Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Hongseok Yang

Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Konferenceartikel › Forskning › peer review

Abstract

Separation logic is a Hoare-style logic for reasoning about pointer-manipulating programs. Its core ideas have recently been extended from low-level to richer, high-level languages. In this paper we develop a new semantics of the logic for a programming language where code can be stored (i.e., with higher-order store). The main improvement on previous work is the simplicity of the model. As a consequence, several restrictions imposed by the semantics are removed, leading to a considerably more natural assertion language with a powerful specification logic.

Originalsprog	Engelsk
Bogserie	Lecture Notes in Computer Science
Sider (fra-til)	348-360
ISSN	0302-9743
Status	Udgivet - 2008
Begivenhed	ICALP 2008 35th International Colloquium on Automata, Languages and Programming - Reykjavik, Island Varighed: 6 jul. 2008 → 13 jul. 2008 Konferencens nummer: 35

Konference

Konference	ICALP 2008 35th International Colloquium on Automata, Languages and Programming
Nummer	35
Land/Område	Island
By	Reykjavik
Periode	06/07/2008 → 13/07/2008

Emneord

Separation Logic
Pointer-Manipulating Programs
Higher-Order Store
Semantics
Specification Logic

Citationsformater

@inproceedings{9ebf89f0832e11ddb75b000ea68e967b,

title = "A Simple Model of Separation Logic for Higher-order Store",

abstract = "Separation logic is a Hoare-style logic for reasoning about pointer-manipulating programs. Its core ideas have recently been extended from low-level to richer, high-level languages. In this paper we develop a new semantics of the logic for a programming language where code can be stored (i.e., with higher-order store). The main improvement on previous work is the simplicity of the model. As a consequence, several restrictions imposed by the semantics are removed, leading to a considerably more natural assertion language with a powerful specification logic.",

keywords = "Separation Logic, Pointer-Manipulating Programs, Higher-Order Store, Semantics, Specification Logic, Separation Logic, Pointer-Manipulating Programs, Higher-Order Store, Semantics, Specification Logic",

author = "Lars Birkedal and Bernhard Reus and Jan Schwinghammer and Hongseok Yang",

note = "Serie: Lecture Notes in Computer Science, Springer, 0302-9743, 1611-3349 Volumne: 5126/2008; ICALP 2008 35th International Colloquium on Automata, Languages and Programming ; Conference date: 06-07-2008 Through 13-07-2008",

year = "2008",

language = "English",

pages = "348--360",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer",

}

TY - GEN

T1 - A Simple Model of Separation Logic for Higher-order Store

AU - Birkedal, Lars

AU - Reus, Bernhard

AU - Schwinghammer, Jan

AU - Yang, Hongseok

N1 - Conference code: 35

PY - 2008

Y1 - 2008

N2 - Separation logic is a Hoare-style logic for reasoning about pointer-manipulating programs. Its core ideas have recently been extended from low-level to richer, high-level languages. In this paper we develop a new semantics of the logic for a programming language where code can be stored (i.e., with higher-order store). The main improvement on previous work is the simplicity of the model. As a consequence, several restrictions imposed by the semantics are removed, leading to a considerably more natural assertion language with a powerful specification logic.

AB - Separation logic is a Hoare-style logic for reasoning about pointer-manipulating programs. Its core ideas have recently been extended from low-level to richer, high-level languages. In this paper we develop a new semantics of the logic for a programming language where code can be stored (i.e., with higher-order store). The main improvement on previous work is the simplicity of the model. As a consequence, several restrictions imposed by the semantics are removed, leading to a considerably more natural assertion language with a powerful specification logic.

KW - Separation Logic

KW - Pointer-Manipulating Programs

KW - Higher-Order Store

KW - Semantics

KW - Specification Logic

KW - Separation Logic

KW - Pointer-Manipulating Programs

KW - Higher-Order Store

KW - Semantics

KW - Specification Logic

M3 - Conference article

SN - 0302-9743

SP - 348

EP - 360

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - ICALP 2008 35th International Colloquium on Automata, Languages and Programming

Y2 - 6 July 2008 through 13 July 2008

ER -