A logic of separating modalities

DOI10.1016/J.TCS.2016.04.040zbMath1342.03032OpenAlexW2346540577MaRDI QIDQ290917

Didier Galmiche, Jean-René Courtault, David J. Pym

Publication date: 3 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.040

zbMATH Keywords

modal logictableauxconcurrencyseparation logicbunched logicresource semantics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Related Items (5)

A stone-type duality theorem for separation logic via its underlying bunched logics ⋮ A calculus and logic of bunched resources and processes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Substructural Epistemic Resource Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Resources, concurrency, and local reasoning
• Using branching time temporal logic to synthesize synchronization skeletons
• Completeness results for linear logic on Petri nets
• Handbook of philosophical logic. Vol. 7
• Possible worlds and resources: The semantics of \(\mathbf{BI}\)
• A Simple Separation Logic
• Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic
• An Epistemic Separation Logic
• The semantics of BI and resource tableaux
• Tableaux and Resource Graphs for Separation Logic
• A Modal BI Logic for Dynamic Resource Properties
• Dynamic Epistemic Logic and Knowledge Puzzles
• Algebra and logic for resource-based systems modelling
• A Logical and Computational Theory of Located Resource
• The Logic of Bunched Implications
• On bunched typing
• BI as an assertion language for mutable data structures
• The formal strong completeness of partial monoidal Boolean BI
• Decidability of DPDA equivalence

This page was built for publication: A logic of separating modalities