Skip to main content

A programming logic for a verified structured assembly language

  • Session 14: Specification and Verificatin
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 624))

Abstract

We describe a derived programming logic for a generic structured assembly language. It has been combined with a compiler correctness theorem. This allows us to deduce correctness properties of object code from corresponding properties of the source code proved with the programming logic. All proofs have been carried out using the HOL system.

This article was processed using the LATEX macro package with LLNCS style.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avra Cohn. The notion of proof in hardware verification. Journal of Automated Reasoning 5, (5):127–138, 1989.

    Article  Google Scholar 

  2. W. J. Cullyer. Implementing safety critical systems: The Viper Microprocessor. In G. Birtwistle and P. A. Subrahmanyam, editors, VLSI Specification, Verification and Synthesis, pages 1–25. Kluwer, 1988.

    Google Scholar 

  3. Paul Curzon. Compiler correctness and input/output. To appear.

    Google Scholar 

  4. Paul Curzon. A verified compiler for a structured assembly language. In Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and its Applications. IEEE Computer Society Press.

    Google Scholar 

  5. Michael J. C. Gordon. HOL: A proof generating system for higher order logic. In G. Birtwistle and P. A. Subrahmanyam, editors, VLSI Specification, Verification and Synthesis, pages 73–128. Kluwer, 1988.

    Google Scholar 

  6. Michael J. C. Gordon. Mechanizing programming logics in higher order logic. In G. Birtwistle and P. A. Subrahmanyam, editors, Current Trends in Hardware Verification and Automated Theorem Proving, pages 387–439. Springer-Verlag, 1989.

    Google Scholar 

  7. C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576–580,583, October 1969.

    Article  Google Scholar 

  8. J. Kershaw. Vista user's guide. Technical Report 401-86, RSRE, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Curzon, P. (1992). A programming logic for a verified structured assembly language. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013078

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55727-2

  • Online ISBN: 978-3-540-47279-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics