Expressivity Properties of Boolean BI Through Relational Models
From MaRDI portal
Recommendations
Cited in
(16)- Proof tactics for assertions in separation logic
- Bunched logics displayed
- A stone-type duality theorem for separation logic via its underlying bunched logics
- Nondeterministic phase semantics and the undecidability of Boolean BI
- Stone-type dualities for separation logics
- A unified display proof theory for bunched logic
- An Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics via Group Semantics
- Undecidability of propositional separation logic and its neighbours
- Looking at separation algebras with Boolean BI-eyes
- Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding
- On Model Checking Boolean BI
- scientific article; zbMATH DE number 7440178 (Why is no real title available?)
- Bringing Order to the Separation Logic Jungle
- Convolution and concurrency
- Abstract hidden Markov models: a monadic account of quantitative information flow
- An algebraic glimpse at bunched implications and separation logic
This page was built for publication: Expressivity Properties of Boolean BI Through Relational Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385999)