Concurrent Kleene algebra and its foundations
From MaRDI portal
Publication:549679
DOI10.1016/J.JLAP.2011.04.005zbMATH Open1278.68176OpenAlexW2096490078WikidataQ114851547 ScholiaQ114851547MaRDI QIDQ549679FDOQ549679
Authors: Bernhard Möller, Georg Struth, Ian Wehrman, Tony Hoare 
Publication date: 18 July 2011
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/38907
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modeling concurrency with partial orders
- Title not available (Why is that?)
- An axiomatic basis for computer programming
- A calculus of communicating systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Resources, concurrency, and local reasoning
- Fixed-point calculus
- The equational theory of pomsets
- A completeness theorem for Kleene algebras and the algebra of regular events
- Title not available (Why is that?)
- Concurrent Kleene Algebra
- Foundations of concurrent Kleene algebra
- Title not available (Why is that?)
- Kleene algebra with domain
- Concurrent Kleene algebra and its foundations
- Synchronous Kleene algebra
- Graphical models of separation logic
- The \(\pi\)-calculus: A theory of mobile processes
- Semiring-based constraint satisfaction and optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- From \(\mu\)CRL to mCRL2: motivation and outline
Cited In (68)
- A semantics and a logic for \textit{Fuzzy Arden Syntax}
- Mitigating covert channels based on analysis of the potential for communication
- Mathematics of Program Construction
- On weighted Petri net transducers
- An event structure model for probabilistic concurrent Kleene algebra
- Brzozowski goes concurrent -- a Kleene theorem for pomset languages
- ST-structures
- Probabilistic concurrent Kleene algebra
- On the relation between concurrent separation logic and concurrent Kleene algebra
- Algebraic coherent confluence and higher globular Kleene algebras
- Laws of programming for references
- Convolution and concurrency
- Balancing expressiveness in formal approaches to concurrency
- Concurrent dynamic algebra
- Taming multirelations
- Convolution as a Unifying Concept
- Concurrent Kleene algebra: free model and completeness
- Title not available (Why is that?)
- An algebra of synchronous atomic steps
- Concurrent Kleene algebra with tests and branching automata
- Developments in concurrent Kleene algebra
- Developments in concurrent Kleene algebra
- Concurrent Kleene algebra and its foundations
- On algebra of program correctness and incorrectness
- Iris: monoids and invariants as an orthogonal basis for concurrent reasoning
- Synchronous Kleene algebra
- Observation-based concurrent program logic for relaxed memory consistency models
- The Boolean algebra of cubical areas as a tensor product in the category of semilattices with zero
- A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency
- Weighted synchronous automata
- Proving language inclusion and equivalence by coinduction
- Schedulers and finishers: on generating and filtering the behaviours of an event structure
- Generalised rely-guarantee concurrency: an algebraic foundation
- Schedulers and finishers: on generating the behaviours of an event structure
- Foundations of concurrent Kleene algebra
- On locality and the exchange law for concurrent processes
- Concurrent Kleene algebra with tests
- Exploring an interface model for CKA
- A program construction and verification tool for separation logic
- Posets with interfaces as a model for concurrency
- Designing a semantic model for a wide-spectrum language with concurrency
- Cylindric Kleene lattices for program construction
- Completeness and incompleteness of synchronous Kleene algebra
- Concurrent algebras: an algebraic study of a fragment of concurrent propositional dynamic logic
- A discrete geometric model of concurrent program execution
- Generating Posets Beyond N
- Title not available (Why is that?)
- Generic models of the laws of programming
- Catoids and modal convolution algebras
- Modal algebra and Petri nets
- \( \ell r\)-multisemigroups, modal quantales and the origin of locality
- Abstract strategies and coherence
- On tools for completeness of Kleene algebra with hypotheses
- In praise of algebra
- Probabilistic rely-guarantee calculus
- On the algebraic structure of Weihrauch degrees
- Modeling quantitative aspects of concurrent systems using weighted Petri net transducers
- Completely and partially executable sequences of actions in deontic context
- Unifying Semantics for Concurrent Programming
- Concurrent Kleene Algebra
- Unifying Operational Weak Memory Verification: An Axiomatic Approach
- Title not available (Why is that?)
- Reordering Derivatives of Trace Closures of Regular Languages.
- On tools for completeness of Kleene algebra with hypotheses
- Title not available (Why is that?)
- An algebraic glimpse at bunched implications and separation logic
- Syllepsis in homotopy type theory
- Specifying and reasoning about shared-variable concurrency
Uses Software
This page was built for publication: Concurrent Kleene algebra and its foundations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549679)
