scientific article; zbMATH DE number 7056224
DOI10.23638/LMCS-15(1:36)2019zbMath1423.68107arXiv1708.01688MaRDI QIDQ5376651
Tahiry Rabehaja, Annabelle McIver, Carroll Morgan
Publication date: 17 May 2019
Full work available at URL: https://arxiv.org/abs/1708.01688
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logic of separating modalities
- Algebraic separation logic
- Coalgebraic semantics of modal logics: an overview
- Generalising canonical extension to the categorical setting
- A semantics for concurrent separation logic
- Resources, concurrency, and local reasoning
- Dijkstra and Hoare monads in monadic computation
- A calculus and logic of bunched resources and processes
- The equational theory of pomsets
- Modular tableaux calculi for separation theories
- Duality for algebras of relevant logics
- Bunched logics displayed
- A stone-type duality theorem for separation logic via its underlying bunched logics
- On the relation between concurrent separation logic and concurrent Kleene algebra
- Varieties of complex algebras
- Intuitionistic Layered Graph Logic
- A substructural logic for layered graphs
- A Program Construction and Verification Tool for Separation Logic
- On Sahlqvist theory for hybrid logics
- Layered graph logic as an assertion language for access control policy models
- Exemplaric Expressivity of Modal Logics
- Undecidability of Propositional Separation Logic and Its Neighbours
- Context logic as modal logic
- Looking at Separation Algebras with Boolean BI-eyes
- The semantics of BI and resource tableaux
- A Modal BI Logic for Dynamic Resource Properties
- Completeness via Canonicity for Distributive Substructural Logics: A Coalgebraic Perspective
- Bunched polymorphism
- Classical BI: Its Semantics and Proof Theory
- Algebra and logic for resource-based systems modelling
- The Logic of Bunched Implications
- A modal separation logic for resource dynamics
- Iris from the ground up: A modular foundation for higher-order concurrent separation logic
- Healthiness from Duality
- A new proof of Sahlqvist's theorem on modal definability and completeness
- Bringing Order to the Separation Logic Jungle
- BI as an assertion language for mutable data structures
- A Substructural Epistemic Resource Logic
- Programming Languages and Systems
- Sub-classical Boolean Bunched Logics and the Meaning of Par
- Expressivity Properties of Boolean BI Through Relational Models
- Compositional Shape Analysis by Means of Bi-Abduction
- Parametric completeness for separation theories
- The formal strong completeness of partial monoidal Boolean BI
- Boolean Algebras with Operators. Part I
This page was built for publication:
