A While Program Normal Form Theorem in Total Correctness

Authors:
Kim Solin
Affiliations:
Uppsala Universitet, Uppsala, Sweden
Venue:
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Year:
2009

Citing 10
Cited 1

A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Kleene algebra with tests

ACM Transactions on Programming Languages and Systems (TOPLAS)
On folk theorems

Communications of the ACM
Flow diagrams, turing machines and languages with only two formation rules

Communications of the ACM
A Discipline of Programming

A Discipline of Programming
Refinement Calculus: A Systematic Introduction

Refinement Calculus: A Systematic Introduction
Separation and Reduction

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
From Kleene Algebra to Refinement Algebra

MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Towards a refinement algebra

Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Kleene algebra with domain

ACM Transactions on Computational Logic (TOCL)

Partial, total and general correctness

MPC'10 Proceedings of the 10th international conference on Mathematics of program construction

Quantified Score

Hi-index	0.00

Visualization

Abstract

A classical while-program normal-form theorem is derived in demonic refinement algebra. In contrast to Kozen's partial-correctness proof of the theorem in Kleene algebra with tests, the derivation in demonic refinement algebra provides a proof that the theorem holds in total correctness.