A Simple Model of Separation Logic for Higher-Order Store

Authors:
Lars Birkedal;Bernhard Reus;Jan Schwinghammer;Hongseok Yang
Affiliations:
IT University of Copenhagen,;University of Sussex, Brighton,;Saarland University, Saarbrücken,;Queen Mary, University of London,
Venue:
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Year:
2008

Citing 13
Cited 6

Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Local Reasoning about Programs that Alter Data Structures

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Separation and information hiding

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Polymorphism and separation in hoare type theory

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Linux Device Drivers, 3rd Edition

Linux Device Drivers, 3rd Edition
Certified self-modifying code

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
BI-hyperdoctrines, higher-order separation logic, and abstraction

ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
Separation logic, abstraction and inheritance

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relational parametricity and separation logic

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Abstract predicates and mutable adts in hoare type theory

ESOP'07 Proceedings of the 16th European conference on Programming
About hoare logics for higher-order store

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Separation logic for higher-order store

CSL'06 Proceedings of the 20th international conference on Computer Science Logic

Hoare logic for higher order store using simple semantics

WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Verification of unloadable modules

FM'11 Proceedings of the 17th international conference on Formal methods
A semantic foundation for hidden state

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Capsules and Separation

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Views: compositional reasoning for concurrent programs

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Specification patterns for reasoning about recursion through the store

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

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.