Concurrent Kleene Algebra

DOI10.1007/978-3-642-04081-8_27zbMath1254.68172MaRDI 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

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

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

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