Skip to main content
SpringerLink
Log in

UTP and Sustainability

  • Conference paper
Book cover Unifying Theories of Programming (UTP 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6445))

Included in the following conference series:

  • 320 Accesses

Abstract

Hoare and He’s approach to unifying theories of programming, UTP, is a dozen years old. In spite of the importance of its ideas, UTP does not seem to be attracting due interest. The purpose of this article is to discuss why that is the case, and to consider UTP’s destiny. To do so it analyses the nature of UTP, focusing primarily on unification, and makes suggestions to expand its use.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Back, R.-J.R., von Wright, J.: Refinement calculus, Part I: Sequential nondeterministic programs. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1989. LNCS, vol. 430, pp. 42–66. Springer, Heidelberg (1989)

    Google Scholar 

  2. Back, R.-J.R., von Wright, J.: Duality in specification languages: a lattice-theoretical approach. Acta Informatica 27(7), 583–625 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  3. Backus, J.W., et al. (eds.): Revised report on the algorithm language algol 60; CACM, 6(1), 1–17 (1963) (Supplement by M. Woodger, 18–20)

    Google Scholar 

  4. Bjørner, D., Jones, C.B.: The Vienna Development Method: The Meta-Language. LNCS, vol. 61. Springer, Heidelberg (1978)

    Book  MATH  Google Scholar 

  5. Cutland, N.J.: Computability: An Introduction to Recursive Function Theory. Cambridge University Press, Cambridge (1980)

    MATH  Google Scholar 

  6. Diacu, F.: The solution of the n-body problem. The Mathematical Intelligencer 18, 66–70 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dijkstra, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Communications of the ACM 18, 453–457 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  8. Duke, R., Rose, G.: Formal Object-Oriented Specification Using Object-Z. Macmillan Press, Basingstoke (2000)

    Google Scholar 

  9. Dunne, S., Stoddart, W. (eds.): UTP 2006. LNCS, vol. 4010, pp. 123–140. Springer, Heidelberg (2006)

    Book  Google Scholar 

  10. Eliot, T.S.: Four Quartets. Harcourt, Inc., New York (1943)

    Google Scholar 

  11. Gardiner, P.H.B., Martin, C.E., de Moor, O.: An algebraic construction of predicate transformers. In: Bird, R.S., Woodcock, J.C.P., Morgan, C.C. (eds.) MPC 1992. LNCS, vol. 669, pp. 100–121. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  12. Hayes, I.J. (ed.): Specification Case Studies. Prentice-Hall International, Englewood Cliffs (1987)

    MATH  Google Scholar 

  13. Hehner, E.C.R.: Predicative programming, parts I and II. Communications of the ACM 27(2), 134–151 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hoare, C.A.R., Wirth, N.: An axiomatic definition of the programming language Pascal. Acta Informatica 2(4), 335–355 (1973)

    Article  MATH  Google Scholar 

  15. Hoare, C.A.R., et al.: The laws of programming. Communications of the ACM 30(8), 672–686 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  16. Hoare, C.A.R.: A theory for the derivation of combinational C-MOS circuit designs. Theoretical Computer Science 90(1), 235–251 (1991)

    Article  MATH  Google Scholar 

  17. Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice Hall, Englewood Cliffs (1998)

    MATH  Google Scholar 

  18. Houston, I., King, S.: CICS project report: Experiences and results from the use of Z in IBM. VDM Europe 1, 588–596 (1991)

    Google Scholar 

  19. Josephs, M.B.: Receptive process theory. Acta Informatica 29(1), 17–31 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  20. Jerome Keisler, H.: Elementary Calculus: An Infinitesimal Approach, 2nd edn. Prindle, Weber and Schmidt (1986)

    Google Scholar 

  21. Knuth, D.E.: The remaining troublespots in algol 60. Communications of the ACM 10(10), 611–617 (1967)

    Article  MATH  Google Scholar 

  22. Lister, A.M.: Fundamentals of Operating Systems, 2nd edn. Macmillan, Basingstoke (1979)

    Book  MATH  Google Scholar 

  23. Lucas, P., Walk, K.: On the formal description of PL/I. In: Halpern, M.I., Shaw, C.J. (eds.) Annual Review in Automatic Programming, vol. 6, pp. 105–182. Pergamon Press, Oxford (1971)

    Google Scholar 

  24. McIver, A.K., Morgan, C.C.: Abstraction, Refinement and Proof for Probabilistic Systems. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  25. Milne, R., Strachey, C.: A Theory of Programming Language Semantics. Chapman and Hall, Boca Raton (1976)

    MATH  Google Scholar 

  26. Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  27. Mitchell, J.C.: Foundations for Programming Languages. MIT Press, Cambridge (1996)

    Google Scholar 

  28. Morgan, C.C.: Programming from Specifications, 1st edn. Prentice-Hall International, Englewood Cliffs (1990)

    MATH  Google Scholar 

  29. Morris, J.M.: A theoretical basis for stepwise refinement and the programming calculus. Science of Computer Programming 9(3), 287–306 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  30. Nauer, P. (ed.): Report on the algorithmic language algol 60. Communications of the ACM 6, 299–314 (1960)

    MathSciNet  Google Scholar 

  31. Nelson, G.: A generalisation of Dijkstra’s calculus. ACM Transactions on Programming Language and Systems 11(4), 517–561 (1989)

    Article  Google Scholar 

  32. Nielsen, F., Nielsen, H.R., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (2005)

    Google Scholar 

  33. Rewitzky, I.M.: Binary Multirelations. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds.) TARSKI 2003. LNCS, vol. 2929, pp. 256–271. Springer, Heidelberg (2003)

    Google Scholar 

  34. Rewitzky, I.M., Sanders, J.W.: Involutions on relational program calculi. Scientific Annals of Computer Science 18, 129–171 (2008)

    MathSciNet  Google Scholar 

  35. de Roever, W.-P., Engelhardt, K.: Data Refinement: Model-Oriented Proof Methods and their Comparison. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1998)

    Book  MATH  Google Scholar 

  36. Roscoe, A.W., Hoare, C.A.R.: The laws of occam programming. Theoretical Computer Science 60(2), 177–229 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  37. Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  38. Spivey, J.M.: The Z Notation: A Reference Manual, 2nd edn. Prentice-Hall International, Englewood Cliffs (1992)

    MATH  Google Scholar 

  39. van Wijngaarden, A., et al.: Revised report on the algorithmic language algol 68. Acta Informatica 5, 1–236 (1975)

    Article  MATH  Google Scholar 

  40. Wikipedia on the competition between VHS and Betamax, http://en.wikipedia.org/wiki/Videotape_format_war

Download references

Author information

Authors and Affiliations

  1. Peking University, Beijing

    Yifeng Chen

  2. UNU-IIST, Macao

    Jeff W. Sanders

Authors
  1. Yifeng Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jeff W. Sanders
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing, University of Teesside, Borough Road, TS1 3BA, Middlesbrough, UK

    Shengchao Qin

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Y., Sanders, J.W. (2010). UTP and Sustainability. In: Qin, S. (eds) Unifying Theories of Programming. UTP 2010. Lecture Notes in Computer Science, vol 6445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16690-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16690-7_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16689-1

  • Online ISBN: 978-3-642-16690-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation