Advertisement

Conscriptions: A New Relational Model for Sequential Computations

  • Steve Dunne
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7681)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Guttmann, W.: Algebras for iteration and infinite computations. Acta Informatica (2012), doi: 10.1007/s00236-012-0162-2Google Scholar
  3. 3.
    Guttmann, W.: Extended designs algebraically. Science of Computer Programming (to appear, 2012)Google Scholar
  4. 4.
    Guttmann, W.: Unifying Correctness Statements. In: Gibbons, J., Nogueira, P. (eds.) MPC 2012. LNCS, vol. 7342, pp. 198–219. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  5. 5.
    Hayes, I.J., Dunne, S.E., Meinicke, L.: Unifying Theories of Programming That Distinguish Nontermination and Abort. In: Bolduc, C., Desharnais, J., Ktari, B. (eds.) MPC 2010. LNCS, vol. 6120, pp. 178–194. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  6. 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. 7.
    Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice Hall (1998)Google Scholar
  8. 8.
    Möller, B.: The Linear Algebra of UTP. In: Uustalu, T. (ed.) MPC 2006. LNCS, vol. 4014, pp. 338–358. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Steve Dunne
    • 1
  1. 1.School of ComputingUniversity of TeessideMiddlesbroughUK

Personalised recommendations