Concurrent Kleene algebra and its foundations
From MaRDI portal
Publication:549679
DOI10.1016/J.JLAP.2011.04.005zbMATH Open1278.68176OpenAlexW2096490078WikidataQ114851547 ScholiaQ114851547MaRDI QIDQ549679FDOQ549679
Ian Wehrman, Bernhard Möller, Georg Struth, 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 μCRL to mCRL2
Cited In (56)
- Reordering Derivatives of Trace Closures of Regular Languages.
- On tools for completeness of Kleene algebra with hypotheses
- An algebraic glimpse at bunched implications and separation logic
- Syllepsis in homotopy type theory
- Specifying and reasoning about shared-variable concurrency
- A Discrete Geometric Model of Concurrent Program Execution
- A semantics and a logic for \textit{Fuzzy Arden Syntax}
- Generic Models of the Laws of Programming
- Unifying Operational Weak Memory Verification: An Axiomatic Approach
- Mitigating covert channels based on analysis of the potential for communication
- Mathematics of Program Construction
- Title not available (Why is that?)
- ST-structures
- On the relation between concurrent separation logic and concurrent Kleene algebra
- Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers
- Algebraic coherent confluence and higher globular Kleene algebras
- Convolution and concurrency
- Balancing expressiveness in formal approaches to concurrency
- Convolution as a Unifying Concept
- Concurrent Kleene algebra: free model and completeness
- Title not available (Why is that?)
- Concurrent Kleene algebra with tests and branching automata
- 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
- A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency
- Laws of Programming for References
- Weighted synchronous automata
- Title not available (Why is that?)
- 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
- Foundations of concurrent Kleene algebra
- Posets with interfaces as a model for concurrency
- Designing a semantic model for a wide-spectrum language with concurrency
- Completeness and incompleteness of synchronous Kleene algebra
- Observation-Based Concurrent Program Logic for Relaxed Memory Consistency Models
- Generating Posets Beyond N
- Title not available (Why is that?)
- On Weighted Petri Net Transducers
- 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
- Taming Multirelations
- Schedulers and Finishers: On Generating the Behaviours of an Event Structure
- On the algebraic structure of Weihrauch degrees
- A Program Construction and Verification Tool for Separation Logic
- Exploring an Interface Model for CKA
- Completely and partially executable sequences of actions in deontic context
- Unifying Semantics for Concurrent Programming
- Concurrent Kleene Algebra
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)
