TY  - JOUR
A1  - Möller, Bernhard
T1  - The linear algebra of UTP
T2  - Lecture Notes in Computer Science
N2  - 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.
Y1  - 2006
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/35941
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-359414
SN  - 0302-9743
VL  - 4014
SP  - 338
EP  - 358
PB  - Springer
ER  -