Skip to main content

Unifying Theories of Undefinedness in UTP

  • Conference paper
Unifying Theories of Programming (UTP 2012)

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

Included in the following conference series:

  • 493 Accesses

Abstract

In previous work, based on an original idea due to Saaltink, we proposed a unifying theory of undefined expressions in logics used for formally specifying software systems. In our current paper, we instantiate these ideas in Hoare and He’s Unifying Theories of Programming, with each different treatment of undefinedness formalized as a UTP theory. In this setting, we show how to use classical logic to prove facts in a monotonic partial logic with guards, and we describe the guards for several different UTP theories. We show how classical logic can be used to prove semi-classical facts. We apply these ideas to the COMPASS Modelling Language (CML), which is an integration of VDM and CSP in the Circus tradition. We link CML, which uses McCarthy’s left-to-right expression evaluation, and to VDM, which uses Jones’s three-valued Logic of Partial Functions.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Agerholm, S., Frost, J.: An Isabelle-based Theorem Prover for VDM-SL. In: Gunter, E.L., Felty, A.P. (eds.) TPHOLs 1997. LNCS, vol. 1275, pp. 1–16. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  2. Bergmann, M.: An Introduction to Many-Valued and Fuzzy Logic: Semantics, Algebras and Derivation Systems. Cambridge University Press (2008)

    Google Scholar 

  3. Bergstra, J.A., Bethke, I., Rodenburg, P.: A propositional logic with 4 values: true, false, divergent and meaningless. Journal of Applied NonClassical Logics 5, 199–217 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bochvar, D.A., Bergmann, M.: On a three-valued logical calculus and its application to the analysis of the paradoxes of the classical extended functional calculus. History and Philosophy of Logic 2(1), 87–112 (1981)

    Article  MathSciNet  Google Scholar 

  5. Goldsmith, M.: FDR2 user’s manual. Technical Report Version 2.82. Formal Systems (Europe) Ltd. (2005)

    Google Scholar 

  6. Gordon, M., Wadsworth, C.P., Milner, R.: Edinburgh LCF. LNCS, vol. 78. Springer, Heidelberg (1979)

    Book  MATH  Google Scholar 

  7. Hoare, C.A.R., He, J.: Unifying Theories of Programming. Series in Computer Science. Prentice Hall (1998)

    Google Scholar 

  8. Larsen, P.G., Battle, N., Ferreira, M.A., Fitzgerald, J.S., Lausdahl, K., Verhoef, M.: The Overture initiative: integrating tools for VDM. ACM SIGSOFT Software Engineering Notes 35, 1–6 (2010)

    Article  Google Scholar 

  9. Rose, A.: A lattice-theoretic characterisation of three-valued logic. Journal of the London Mathematical Society 25, 255–259 (1950)

    Article  MATH  Google Scholar 

  10. Saaltink, M.: The Z/EVES System. In: Bowen, J.P., Hinchey, M.G., Till, D. (eds.) ZUM 1997. LNCS, vol. 1212, pp. 72–85. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  11. Woodcock, J., Saaltink, M., Freitas, L.: Unifying theories of undefinedness. In: Summer School Marktoberdorf 2008: Engineering Methods and Tools for Software Safety and Security. NATO ASI Series F. IOS Press, Amsterdam (2009)

    Google Scholar 

  12. Woodcock, J., Freitas, L.: Linking VDM and Z. In: Hinchey, M. (ed.) ICECCS, pp. 143–152. IEEE Computer Society (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Woodcock, J., Bandur, V. (2013). Unifying Theories of Undefinedness in UTP. In: Wolff, B., Gaudel, MC., Feliachi, A. (eds) Unifying Theories of Programming. UTP 2012. Lecture Notes in Computer Science, vol 7681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35705-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35705-3_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35704-6

  • Online ISBN: 978-3-642-35705-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics