Weak Kleene Algebra and Computation Trees

DOI10.1007/11828563_1MaRDI QIDQ5459170zbMATH OpenOpenAlexFDO

Authors Ernie Cohen

Publication date 24 April 2008

Published in Relations and Kleene Algebra in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11828563_1

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Mathematics of Program Construction
• Kleene getting lazy
• Multirelational models of lazy, monodic tree, and probabilistic Kleene algebras
• On Kleene algebras for weighted computation
• Monodic Tree Kleene Algebra

Cited in

(8)

• Weak sequential theories of finite full binary trees
• scientific article; zbMATH DE number 1696720 (Why is no real title available?)
• Multirelational models of lazy, monodic tree, and probabilistic Kleene algebras
• Equational theories of abnormal termination based on Kleene algebra
• Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
• Mathematics of Program Construction
• Monodic Tree Kleene Algebra
• Relational and Kleene-Algebraic Methods in Computer Science

This page was built for publication: Weak Kleene Algebra and Computation Trees

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