Conscriptions: A New Relational Model for Sequential Computations
We define a new class of UTP homogeneous binary relations called conscriptions, which like prescriptions provide a general-correctness model of sequential computations. Their novelty is that the skip conscription is a right unit of sequential composition for all conscriptions, including even those whose assumptions refer to the after-state as well as before-state; they thus improve on prescriptions by providing a less restricted, and hence more expressive, general-correctness model for sequential computations. We also exploit our conscription concept to derive two new enriched sequential models, extended conscriptions and timed conscriptions, which differentiate between aborting and non-terminating computations.
Unable to display preview. Download preview PDF.
- 1.Dunne, S.E.: Recasting Hoare and He’s unifying theory of programs in the context of general correctness. In: Butterfield, A., Strong, G., Pahl, C. (eds.) Proceedings of the 5th Irish Workshop in Formal Methods, IWFM 2001, Workshops in Computing. British Computer Society (2001), http://ewic.bcs.org/conferences/2001/5thformal/papers
- 2.Guttmann, W.: Algebras for iteration and infinite computations. Acta Informatica (2012), doi: 10.1007/s00236-012-0162-2Google Scholar
- 3.Guttmann, W.: Extended designs algebraically. Science of Computer Programming (to appear, 2012)Google Scholar
- 6.Hayes, I.J., Dunne, S.E., Meinicke, L.: Linking unifying theories of program refinement. Science of Computer Programming (to appear, 2012)Google Scholar
- 7.Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice Hall (1998)Google Scholar