On Two Dually Nondeterministic Refinement Algebras

A dually nondeterministic refinement algebra with a negation operator is proposed. The algebra facilitates reasoning about total-correctness preserving program transformations and nondeterministic programs. The negation operator is used to express enabledness and termination operators through a useful explicit definition. As a small application, a property of action systems is proved employing the algebra. A dually nondeterministic refinement algebra without the negation operator is also discussed.

[1]  Dexter Kozen,et al.  Automata and Computability , 1997, Undergraduate Texts in Computer Science.

[2]  Carroll Morgan,et al.  Programming from specifications , 1990, Prentice Hall International Series in computer science.

[3]  Dexter Kozen.  A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , 1994, Inf. Comput..

[4]  Georg Struth,et al.  Kleene algebra with domain , 2003, TOCL.

[5]  Carroll Morgan,et al.  Programming from specifications (2nd ed.) , 1994 .

[6]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[7]  Smc Smc Afdeling Zuivere Wiskunde.  Mathematical centre amsterdam , 1953 .

[8]  Greg Nelson,et al.  A generalization of Dijkstra's calculus , 1989, ACM Trans. Program. Lang. Syst..

[9]  Ralph-Johan Back,et al.  Decentralization of Process Nets with Centralized Control , 1983, PODC.

[10]  Robert W. Floyd,et al.  Nondeterministic Algorithms , 1967, JACM.

[11]  Kaisa Sere,et al.  Stepwise Refinement of Action Systems , 1991, Struct. Program..

[12]  Augusto Sampaio.  An Algebraic Approach to Compiler Design , 1993, AMAST Series in Computing.

[13]  Ralph-Johan Back,et al.  Duality in specification languages: a lattice-theoretical approach , 1990, Acta Informatica.

[14]  Joakim von Wright,et al.  Refinement Algebra with Operators for Enabledness and Termination , 2006, MPC.

[15]  Ralph-Johan Back,et al.  Refinement Calculus: A Systematic Introduction , 1998 .

[16]  Manfred Broy,et al.  Adding fair choice to Dijkstra's calculus , 1994, TOPL.

[17]  Carroll Morgan,et al.  Data Refinement of Predicate Transformers , 1991, Theor. Comput. Sci..

[18]  R. Milner.  Mathematical Centre Tracts , 1976 .

[19]  Ralph-Johan Back,et al.  Reasoning algebraically about loops , 1999, Acta Informatica.

[20]  Bernhard Möller,et al.  Lazy Kleene Algebra , 2004, MPC.

[21]  Ralph-Johan Back,et al.  Correctness preserving program refinements: Proof theory and applications , 1980 .

[22]  Dexter Kozen,et al.  Kleene algebra with tests , 1997, TOPL.