Algebras of modal operators and partial correctness

Modal Kleene algebras are Kleene algebras enriched by forward and backward box and diamond operators. We formalise the symmetries of these operators as Galois connections, complementarities and dualities. We study their properties in the associated operator algebras and show that the axioms of relation algebra are theorems at the operator level. Modal Kleene algebras provide a unifying semantics for various program calculi and enhance efficient cross-theory reasoning in this class, often in a very concise pointfree style. This claim is supported by novel algebraic soundness and completeness proofs for Hoare logic and by connecting this formalism with an algebraic decision procedure.

[1]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[2]  A. Tarski,et al.  Boolean Algebras with Operators , 1952 .

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

[4]  Ernie Cohen,et al.  Separation and Reduction , 2000, MPC.

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

[6]  Jules Desharnais,et al.  Modal Kleene algebra and applications - a survey , 2004 .

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

[8]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

[9]  Georg Struth,et al.  wp Is wlp , 2005 .

[10]  Dexter Kozen,et al.  On the Elimination of Hypotheses in Kleene Algebra with Tests , 2002 .

[11]  Jacques Loeckx,et al.  The Foundations of Program Verification, 2nd ed , 1987 .

[12]  Joakim von Wright,et al.  From Kleene Algebra to Refinement Algebra , 2002, MPC.

[13]  Yde Venema,et al.  Dynamic Logic by David Harel, Dexter Kozen and Jerzy Tiuryn. The MIT Press, Cambridge, Massachusetts. Hardback: ISBN 0–262–08289–6, $50, xv + 459 pages , 2002, Theory and Practice of Logic Programming.

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

[15]  Jacques Loeckx,et al.  The Foundations of Program Verification, 1st ed , 1984 .

[16]  Roland Carl Backhouse,et al.  Demonic operators and monotype factors , 1993, Mathematical Structures in Computer Science.

[17]  Dexter Kozen.  Some Results in Dynamic Model Theory , 2002, MPC.

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

[19]  Vaughan R. Pratt,et al.  Dynamic algebras: Examples, constructions, applications , 1991, Stud Logica.

[20]  Georg Struth,et al.  Kleene Modules , 2003, RelMiCS.

[21]  Jules Desharnais,et al.  Characterizing determinacy in Kleene algebras , 2001, Inf. Sci..

[22]  Georg Struth,et al.  Modal Kleene Algebra and Partial Correctness , 2004, AMAST.

[23]  Burghard von Karger,et al.  Temporal algebra , 1998, Mathematical Structures in Computer Science.

[24]  Dexter Kozen,et al.  On Kleene Algebras and Closed Semirings , 1990, MFCS.

[25]  Georg Struth,et al.  Termination in Modal Kleene Algebra , 2004, IFIP TCS.

[26]  Anish Arora,et al.  Book Review: Verification of Sequential and Concurrent Programs by Krzysztof R. Apt and Ernst-Riidiger Olderog (Springer-Verlag New York, 1997) , 1998, SIGA.

[27]  Dexter Kozen.  On Hoare logic and Kleene algebra with tests , 2000, TOCL.

[28]  Gunther Schmidt,et al.  Relations and Graphs: Discrete Mathematics for Computer Scientists , 1993 .

[29]  Ernst-Rüdiger Olderog,et al.  Verification of Sequential and Concurrent Programs , 1997, Graduate Texts in Computer Science.

[30]  A. Tarski,et al.  Boolean Algebras with Operators. Part I , 1951 .