Skip to main content
SpringerLink
Log in

Hierarchical Organisation of Predicate-Semantic Models

  • Conference paper
Unifying Theories of Programming (UTP 2006)

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

Included in the following conference series:

Abstract

This paper introduces techniques to organise predicate- semantic models in a hierarchical structure so that a new model can inherit the laws of the existing ones. Generic composition is used to simplify the manipulation of predicates. Necessary restrictions are imposed on the definition of each model so that the inheritance relation can be established by checking a few conditions on the healthiness conditions and the commands. Much of the checking can be supported by laws of generic composition. The techniques also help simplify the proof of well-definedness of program combinators (i.e. their closure in the semantic space) so that we no longer need to prove it (in predicate calculus) for every new model.

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. Chen, Y.: Formal Methods for Global Synchrony. PhD thesis, Oxford University Computing Laboratory (2001)

    Google Scholar 

  2. Chen, Y.: Generic composition. Formal Aspects of Computing 14(2), 108–122 (2002)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  5. Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5, 285–309 (1955)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Durham, Durham, DH1 3LE, UK

    Yifeng Chen

Authors
  1. Yifeng Chen
    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, TS1 3BA, Middlesbrough, UK

    Steve Dunne

  2. University of Teesside,  

    Bill Stoddart

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Y. (2006). Hierarchical Organisation of Predicate-Semantic Models. In: Dunne, S., Stoddart, B. (eds) Unifying Theories of Programming. UTP 2006. Lecture Notes in Computer Science, vol 4010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11768173_10

Download citation

  • DOI: https://doi.org/10.1007/11768173_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34750-7

  • Online ISBN: 978-3-540-34752-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation