Concurrent Kleene Algebra

DOI10.1007/978-3-642-04081-8_27zbMath1254.68172OpenAlexW2104255209MaRDI QIDQ3184688

Georg Struth, Bernhard Möller, Ian Wehrman, C. A. R. Hoare

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-10944

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (27)

A Finite Axiomatisation of Finite-State Automata Using String Diagrams ⋮ Concurrent Kleene algebra with tests and branching automata ⋮ Algebra Unifies Operational Calculi ⋮ The Laws of Programming Unify Process Calculi ⋮ Expression-Based Aliasing for OO–languages ⋮ On Rely-Guarantee Reasoning ⋮ Parallelized sequential composition and hardware weak memory models ⋮ In praise of algebra ⋮ Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks ⋮ Unnamed Item ⋮ A fine-grained semantics for arrays and pointers under weak memory models ⋮ On series-parallel pomset languages: rationality, context-freeness and automata ⋮ A string diagrammatic axiomatisation of finite-state automata ⋮ Learning pomset automata ⋮ Completeness for Identity-free Kleene Lattices ⋮ Probabilistic rely-guarantee calculus ⋮ On the algebraic structure of Weihrauch degrees ⋮ Mitigating covert channels based on analysis of the potential for communication ⋮ Algebraic separation logic ⋮ Concurrent Kleene algebra and its foundations ⋮ Unnamed Item ⋮ Synchronous Kleene algebra ⋮ A type checking algorithm for concurrent object protocols ⋮ Unnamed Item ⋮ Constructing the Views Framework ⋮ Algebra of Monotonic Boolean Transformers ⋮ Unnamed Item

Uses Software

• Prover9
• Mace4

Cites Work

• Resources, concurrency, and local reasoning
• Modeling concurrency with partial orders
• A calculus of communicating systems
• A completeness theorem for Kleene algebras and the algebra of regular events
• Foundations of Concurrent Kleene Algebra
• Axioms for memory access in asynchronous hardware systems
• Semiring-based constraint satisfaction and optimization
• From μCRL to mCRL2
• Kleene algebra with domain
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Concurrent Kleene Algebra