Skip to main content
SpringerLink
Log in

Towards totally verified systems

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematics of Program Construction (MPC 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 375))

Included in the following conference series:

Abstract

With the increasing complexity and criticality of computer based systems it is important to verify the overall behaviour of the entire system. Much of the theoretical background needed for such a task is already available and could be used to implement totally verified systems. This paper sets out to show how a simple application could be verified. An application is implemented in a simple language and verified to be correct. This program is then compiled for a simple instruction set by a verified compiler. This instruction set is then implemented on a simple verified processor.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barrett, G., The Semantics and Implementation of occam, Phd Thesis, Oxford Universtity, 1988.

    Google Scholar 

  2. Barrett, G., Formal methods applied to a floating point number system, Oxford University Programming Research Group Technical Monograph PRG-58, 1987.

    Google Scholar 

  3. Cohn, A., A proof of correctness of the Viper microprocessor: the first level, University of Cambridge Computer Laboratory Technical Report No. 104, 1987.

    Google Scholar 

  4. Goldsmith,M., The Oxford occam Transformation System (Version 0,1) — (Draft user documentation), Oxford University Programming Research Group, January 1988.

    Google Scholar 

  5. Gordon, M.J.C., Mechanizing programming logic in HOL, University of Cambridge Computer Laboratory Technical Report No. 145, 1989.

    Google Scholar 

  6. Hoare, C.A.R., A calculus fot the derivation of c-mos switching circuits, Draft April 1988.

    Google Scholar 

  7. Hunt, W.A., FM8501: A verified microprocessor, University of Texas at Austin Technical Report 47, 1985.

    Google Scholar 

  8. INMOS, The transputer instruction set manual — a compiler writer's guide, Prentice Hall, 1988.

    Google Scholar 

  9. Moore, J.S., Verification of Piton assembler, Computational Logic Incorporated, Austin, Texas.

    Google Scholar 

  10. Roscoe, A.W., “Denotational semantics for occam” in Proceedings for July 1984 Seminar on Concurrency, Springer LNCS vol. 197, 1985.

    Google Scholar 

  11. Shepherd, D.E., “The role of occam in the design of the IMS T800” in Communicating Process Architecture, Prentice Hall, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INMOS Ltd., Bristol, UK

    David May & David Shepherd

Authors
  1. David May
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Shepherd
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. L. A. van de Snepscheut

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

May, D., Shepherd, D. (1989). Towards totally verified systems. In: van de Snepscheut, J.L.A. (eds) Mathematics of Program Construction. MPC 1989. Lecture Notes in Computer Science, vol 375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51305-1_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-51305-1_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51305-6

  • Online ISBN: 978-3-540-46191-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation