Graphical models of separation logic

Authors:
Ian Wehrman;C. A. R. Hoare;Peter W. O'Hearn
Affiliations:
The University of Texas at Austin, USA;Microsoft Research Cambridge, UK;Queen Mary University London, UK
Venue:
Information Processing Letters
Year:
2009

Citing 13
Cited 4

Event structures

Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
An axiomatic basis for computer programming

Communications of the ACM
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
On Kleene Algebras and Closed Semirings

MFCS '90 Proceedings of the Mathematical Foundations of Computer Science 1990
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Spatial Logic for Querying Graphs

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial

Seminar on Concurrency, Carnegie-Mellon University
A spatial logic for concurrency (part I)

Information and Computation - TACS 2001
Possible worlds and resources: the semantics of BI

Theoretical Computer Science - Mathematical foundations of programming semantics
A Calculus and logic of resources and processes

Formal Aspects of Computing
Context logic as modal logic: completeness and parametric inexpressivity

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resources, concurrency, and local reasoning

Theoretical Computer Science
Local Action and Abstract Separation Logic

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science

Algebra, logic, locality, concurrency

CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Algebra, logic, locality, concurrency

APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
The laws of programming unify process calculi

MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Generic models of the laws of programming

Theories of Programming and Formal Methods

Quantified Score

Hi-index	0.89

Visualization

Abstract

Graphs are used to model control and data flow among events occurring in the execution of a concurrent program. Our treatment of data flow covers both shared storage and external communication. Nevertheless, the laws of Hoare and Jones correctness reasoning remain valid when interpreted in this general model.