Relational separation logic

Authors:
Hongseok Yang
Affiliations:
Department of Computer Science, Queen Mary, University of London, Mile End Road, London, UK
Venue:
Theoretical Computer Science
Year:
2007

Citing 11
Cited 23

Prespecification in data refinement

Information Processing Letters
A certifying compiler for Java

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Craft of Programming

The Craft of Programming
Data Refinement Refined

ESOP '86 Proceedings of the European Symposium on Programming
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Semantic Basis for Local Reasoning

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Local reasoning for stateful programs

Local reasoning for stateful programs
Simple relational correctness proofs for static analyses and program transformations

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Local reasoning about a copying garbage collector

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compilers: Principles, Techniques, and Tools (2nd Edition)

Compilers: Principles, Techniques, and Tools (2nd Edition)

Observational purity and encapsulation

Theoretical Computer Science
Formalizing and verifying semantic type soundness of a simple compiler

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Modular Reasoning in Object-Oriented Programming

Verified Software: Theories, Tools, Experiments
Local rely-guarantee reasoning

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compiling functional types to relational specifications for low level imperative code

Proceedings of the 4th international workshop on Types in language design and implementation
Inter-program Properties

SAS '09 Proceedings of the 16th International Symposium on Static Analysis
A relational modal logic for higher-order stateful ADTs

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic numeric abstractions for heap-manipulating programs

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relational verification using product programs

FM'11 Proceedings of the 17th international conference on Formal methods
Relational decomposition

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
A machine-checked framework for relational separation logic

SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
A rely-guarantee-based simulation for verifying concurrent program transformations

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstracting allocation

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Secure information flow by self-composition

Mathematical Structures in Computer Science - Programming Language Interference and Dependence
Refinement and separation contexts

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
From coupling relations to mated invariants for checking information flow

ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Compositional reasoning for pointer structures

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Parameterized memory models and concurrent separation logic

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Proving acceptability properties of relaxed nondeterministic approximate programs

Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Dependent Type Theory for Verification of Information Flow and Access Control Policies

ACM Transactions on Programming Languages and Systems (TOPLAS)
Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
On construction of a library of formally verified low-level arithmetic functions

Innovations in Systems and Software Engineering
Rely-Guarantee-Based Simulation for Compositional Verification of Concurrent Program Transformations

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we present a Hoare-style logic for specifying and verifying how two pointer programs are related. Our logic lifts the main features of separation logic, from an assertion to a relation, and from a property about a single program to a relationship between two programs. We show the strength of the logic, by proving that the Schorr-Waite graph marking algorithm is equivalent to the depth-first traversal.