Abstract

KAT (Kleene Algebra with Tests) have proved to be useful for reasoning about programs in a partial correctness framework. We describe DRA (demonic Refinement Algebra), a variation of KAT for total correctness and illustrate its modeling and reasoning power with a number of applications and examples.

Citations

1310	A disciplne of programming - Dijkstra - 1976
458	Programming from Specifications - Morgan - 1994
439	The Science of Programming - Gries - 1981
237	Refinement Calculus, A Systematic Introduction - Back, Wright - 1998
106	Correctness Preserving Program Refinements: Proof Theory and Applications - Back - 1980
96	Trace Refinement of Action Systems - Back, Wright - 1994
87	Kleene algebra with tests - Kozen - 1997
36	A method for refining atomicity in parallel algorithms - Back
36	Programming from Speci cations - Morgan - 1990
33	On Hoare Logic and Kleene Algebra with Tests - Kozen - 2000
31	Seperation and reduction - Cohen - 2000
27	Certification of compiler optimizations using Kleene algebra with tests - Kozen, Patron
25	Regular algebra applied to path-finding problems - Backhouse, Carré - 1975
16	Program inversion: more than fun - Chen, Udding - 1988
15	Trace Re nement of Action Systems - Back, Wright
14	Re nement Calculus: A Systematic Introduction. Graduate Texts in Computer Science - Back, Wright - 1998
12	Reasoning algebraically about loops - Back, Wright - 1999
11	Correctness Preserving Program Re nements: Proof Theory and Applications - Back - 1980
4	Regular algebra applied to path- nding problems - Backhouse, Carre - 1975
3	Re ning atomicity in parallel algorithms - Back - 1989
3	Certi cation of compiler optimizations using Kleene Algebra with tests - Kozen, Patron - 2000
1	Software Veri cation Research - Rep - 2001