Hierarchical Organisation of Predicate-Semantic Models (original) (raw)

317 Accesses
4 Citations

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.

Preview

Unable to display preview. Download preview PDF.

References

Chen, Y.: Formal Methods for Global Synchrony. PhD thesis, Oxford University Computing Laboratory (2001)
Google Scholar
Chen, Y.: Generic composition. Formal Aspects of Computing 14(2), 108–122 (2002)
Article MATH Google Scholar
Hoare, C.A.R., et al.: Laws of programming. Communications of the ACM 30(8), 672–686 (1987)
Article MathSciNet MATH Google Scholar
Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)
Google Scholar
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

Department of Computer Science, University of Durham, Durham, DH1 3LE, UK
Yifeng Chen

Editor information

Editors and Affiliations

School of Computing, University of Teesside, TS1 3BA, Middlesbrough, UK
Steve Dunne
University of Teesside,
Bill Stoddart

Rights and permissions

Copyright information

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

.RIS
.ENW
.BIB
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 Science Computer Science (R0)Springer Nature Proceedings Computer Science

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.