Domain reasoning in TopKAT
From MaRDI portal
Cites work
- A completeness theorem for Kleene algebras and the algebra of regular events
- Automated Reasoning in Kleene Algebra
- Axiomatizability of positive algebras of binary relations
- Completeness theorems for Kleene algebra with top
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Concurrent Kleene algebra: free model and completeness
- Developments in concurrent Kleene algebra
- Equational theories of abnormal termination based on Kleene algebra
- Free Kleene algebras with domain
- scientific article; zbMATH DE number 3967883 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 6456209 (Why is no real title available?)
- Internal axioms for domain semirings
- Kleene algebra with domain
- Kleene algebra with hypotheses
- Left-handed completeness
- Local reasoning about the presence of bugs: incorrectness separation logic
- Netkat, semantic foundations for networks
- On algebra of program correctness and incorrectness
- On Hoare logic and Kleene algebra with tests
- On the calculus of relations.
- On the complexity of Kleene algebra with domain
- On the complexity of reasoning in Kleene algebra
- On the positive calculus of relations with transitive closure
- On tools for completeness of Kleene algebra with hypotheses
- Reverse Hoare logic
This page was built for publication: Domain reasoning in TopKAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875019)
