Independence and Concurrent Separation Logic

Authors:
Jonathan Hayman;Glynn Winskel
Affiliations:
University of Cambridge;University of Cambridge
Venue:
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Year:
2006

Citing 0
Cited 5

Logics and Bisimulation Games for Concurrency, Causality and Conflict

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Granularity and concurrent separation logic

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Precision and the Conjunction Rule in Concurrent Separation Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Concurrent Separation Logic and Operational Semantics

Electronic Notes in Theoretical Computer Science (ENTCS)
Events, causality and symmetry

VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

A compositional Petri net based semantics is given to a simple pointer-manipulating language. The model is then applied to give a notion of validity to the judgements made by concurrent separation logic that emphasizes the processenvironment duality inherent in such rely-guarantee reasoning. Soundness of the rules of concurrent separation logic with respect to this definition of validity is shown. The independence information retained by the Petri net model is then exploited to characterize the independence of parallel processes enforced by the logic. This is shown to permit a refinement operation capable of changing the granularity of atomic actions.