Normal forms in total correctness for while programs and action systems
From MaRDI portal
Publication:549683
DOI10.1016/j.jlap.2011.04.008zbMath1221.68063MaRDI QIDQ549683
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
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enabledness and termination in refinement algebra
- A completeness theorem for Kleene algebras and the algebra of regular events
- Towards a refinement algebra
- Refinement algebra for probabilistic programs
- Automated Reasoning in Kleene Algebra
- A While Program Normal Form Theorem in Total Correctness
- Distributed cooperation with action systems
- On folk theorems
- Refinement Calculus
- Programming as a Discipline of Mathematical Nature
- Kleene algebra with domain
- Using Probabilistic Kleene Algebra for Protocol Verification
- Flow diagrams, turing machines and languages with only two formation rules