Skip to main content
Log in

Termination conventions and comparative semantics

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The notion of termination is examined, first for its physical observability, then for its part in six semantic formalisms, with emphasis on predicative semantics.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E.W. Dijkstra: A Discipline of Programming. Englewood Cliffs, N.J.: Prentice-Hall 1976

    MATH  Google Scholar 

  2. E.C.R. Hehner: Predicative Programming. Commun. ACM 27, 134–151 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  3. E.C.R. Hehner, L.E. Gupta, A.J. Malton: Predicative Methodology. Acta Inf. 23, 487–505 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  4. C.B. Jones: Systematic Software Development using VDM. London: Prentice-Hall Int. 1986

    MATH  Google Scholar 

  5. D.L. Parnas: A generalized control structure and its formal definition. C. ACM 26, 572–581 (1983)

    Article  MATH  Google Scholar 

  6. W.A. Robison: A Deterministic Trace Semantics for Communicating Sequential Processes. M.A.Sc. Thesis, University of Toronto, 1986

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hehner, E.C.R., Malton, A.J. Termination conventions and comparative semantics. Acta Informatica 25, 1–14 (1988). https://doi.org/10.1007/BF00268842

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00268842

Keywords

Navigation