Kleene algebra of weighted programs with domain
From MaRDI portal
Publication:6546613
DOI10.1007/978-3-031-51777-8_4MaRDI QIDQ6546613
Publication date: 29 May 2024
program semanticsKleene algebra with testsKleene algebra with domainweakest precondition calculusweighted programs
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?)
- Internal axioms for domain semirings
- Verification of sequential and concurrent programs
- Residuated lattices. An algebraic glimpse at substructural logics
- Propositional dynamic logic of regular programs
- A completeness theorem for Kleene algebras and the algebra of regular events
- On multisemigroups.
- Catoids and modal convolution algebras
- Guarded commands, nondeterminacy and formal derivation of programs
- On Kleene Algebras for Weighted Computation
- Generalising KAT to Verify Weighted Computations
- Dynamic predicate logic
- Kleene algebra with domain
- An axiomatic basis for computer programming
- On the complexity of Kleene algebra with domain
- Probabilistic guarded KAT Modulo bisimilarity: completeness and complexity
This page was built for publication: Kleene algebra of weighted programs with domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546613)
