Normal forms in total correctness for while programs and action systems

DOI10.1016/J.JLAP.2011.04.008zbMATH Open1221.68063OpenAlexW2054917142MaRDI QIDQ549683FDOQ549683

Authors: Kim Solin 

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://doi.org/10.1016/j.jlap.2011.04.008

Recommendations

• A while program normal form theorem in total correctness
• Algebras for program correctness in Isabelle/HOL
• Towards a refinement algebra
• Partial, total and general correctness
• scientific article; zbMATH DE number 2090029

zbMATH Keywords

demonic refinement algebra

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Refinement Calculus
• A completeness theorem for Kleene algebras and the algebra of regular events
• Towards a refinement algebra
• Title not available (Why is that?)
• Automated Reasoning in Kleene Algebra
• Programming as a Discipline of Mathematical Nature
• Kleene algebra with domain
• Enabledness and termination in refinement algebra
• Using Probabilistic Kleene Algebra for Protocol Verification
• Flow diagrams, turing machines and languages with only two formation rules
• Distributed cooperation with action systems
• Refinement algebra for probabilistic programs
• A while program normal form theorem in total correctness
• On folk theorems
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Two normal form theorems for CSP programs
• A while program normal form theorem in total correctness
• Title not available (Why is that?)

This page was built for publication: Normal forms in total correctness for while programs and action systems

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