Generalising KAT to Verify Weighted Computations

DOI10.7561/SACS.2019.2.141MaRDI QIDQ5089610zbMATH OpenFDO

Authors Leandro G. Gomes, Alexandre Madeira, L. S. Barbosa

Publication date 19 July 2022

Published in Scientific Annals of Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.01146

zbMATH Keywords

fuzzy relationsgraded testsHoare logicKleene algebra

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Quantitative Verification of Weighted Kripke Structures
• On the Verification of Weighted Kripke Structures Under Uncertainty
• scientific article; zbMATH DE number 6905198
• On Kleene algebras for weighted computation
• Parametric verification of weighted systems
• KAT-ML: an interactive theorem prover for Kleene algebra with tests
• A framework for the verification of certifying computations
• \( \mathbb{K}\) and KIV: towards deductive verification for arbitrary programming languages
• Using Probabilistic Kleene Algebra for Protocol Verification

Cited in

(9)

• A semantics and a logic for \textit{Fuzzy Arden Syntax}
• scientific article; zbMATH DE number 6905198 (Why is no real title available?)
• Quantitative Verification of Weighted Kripke Structures
• On Kleene algebras for weighted computation
• Kleene algebra of weighted programs with domain
• Some uses of modal semirings
• Paraconsistent relations as a variant of Kleene algebras
• Completeness of finitely weighted Kleene algebra with tests
• A Kleene algebra with tests for union bound reasoning about probabilistic programs

This page was built for publication: Generalising KAT to Verify Weighted Computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089610)