The Linear Algebra of UTP
We show that the well-known algebra of matrices over a semiring can be used to reason conveniently about predicates as used in the Unifying Theories of Programming (UTP). This allows a simplified treatment of the designs of Hoare and He and the prescriptions of Dunne. In addition we connect the matrix approach with the theory of test and condition semirings and the modal operators diamond and box. This allows direct re-use of the results and proof techniques of Kleene algebra with tests for UTP as well as a connection to traditional wp/wlp semantics. Finally, we show that matrices of predicate transformers allow an even more streamlined treatment and removal of a restricting assumption on the underlying semirings.
KeywordsLinear Algebra Boolean Algebra Composition Operator Galois Connection State Predicate
Unable to display preview. Download preview PDF.
- 1.Aarts, C.J.: Galois connections presented calculationally. MSc thesis. Dept. of Math. and Comput. Sci., Eindhoven Univ. of Techn. (1992)Google Scholar
- 2.Desharnais, J., Möller, B., Struth, G.: Kleene algebra with domain. ACM Trans. on Comput. Logic (to appear)Google Scholar
- 3.Dunne, S.: Recasting Hoare and He’s unifying theory of programs in the context of general correctness. In: Butterfield, A., Strong, G., Pahl, C. (eds.) Proc. of 5th Irish Wksh. on Formal Methods. Electron. Wkshs. in Comput. Sci. British Comput. Soc. (2001)Google Scholar
- 5.Hoare, C.A.R., He, J.: Unifying theories of programming. Prentice Hall, Englewood Cliffs (1998)Google Scholar
- 6.Höfner, P., Möller, B., Solin, K.: Omega algebra, demonic refinement algebra and commands. Techn. Report 2006-11. Inst. für Informatik, Univ. Augsburg (2006)Google Scholar