Abstraction Mechanisms for Hardware Verification

  • Thomas F. Melham
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 35)

Abstract

It is argued that techniques for proving the correctness of hardware designs must use abstraction mechanisms for relating formal descriptions at different levels of detail. Four such abstraction mechanisms and their formalisation in higher order logic are discussed.

Keywords

Corn Tempo 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Camilleri, A.J., Gordon, M.J.C. and Melham, T.F., ‘Hardware Verification Using Higher Order Logic,’ to appear in: Proceedings of the IFIP International Conference: From H.D.L. Descriptions to Guaranteed Correct Circuit Designs, Grenoble, September 9–11, 1986.Google Scholar
  2. [2]
    Gordon, M.J.C., ‘HOL: A Machine Oriented Formulation of Higher Order Logic,’ Technical Report No. 68, Computer Laboratory, University of Cambridge, 1985.Google Scholar
  3. [3]
    Gordon, M.J.C., ‘HOL: A Proof Generating System for Higher Order Logic,’ in: VLSI Specification, Verification and Synthesis, G.M. Birtwistle and P.A. Subrahmanyam, eds., (this volume).Google Scholar
  4. [4]
    Gordon, M.J.C., ‘Why Higher Order Logic is a Good Formalism for Specifying and Verifying Hardware,’ in: Formal Aspects of VLSI Design: Proceedings of the 1985 Edinburgh Conference on VLSI, G.J. Milne and P.A. Subrahmanyam, eds., North-Holland, Amsterdam, 1986.Google Scholar
  5. [5]
    Halbwachs, N., Lonchampt, A. and Pilaud, D., ‘Describing and Designing Circuits by means of a Synchronous Declarative Language,’ to appear in: Proceedings of the IFIP International Conference: From H.D.L. Descriptions to Guaranteed Correct Circuit Designs, Grenoble, September 9–11, 1986.Google Scholar
  6. [6]
    Hanna, F.K. and Daeche, N., ‘Specification and Verification using HigherOrder Logic: A Case Study,’ in: Formal Aspects of VLSI Design: Proceedings of the 1985 Edinburgh Conference on VLSI, G.J. Milne and P.A. Subrahmanyam, eds., North-Holland, Amsterdam, 1986.Google Scholar
  7. [7]
    Hanna, F.K. and Daeche, N., ‘Specification and verification of digital systems using higher-order predicate logic,’ IEE Proceedings-E, VoL 133, Part E, No. 5, September 1986, pp. 242–254.Google Scholar
  8. [8]
    Herbert, J.M.J., Ph.D. Thesis, The University of Cambridge, to appear in 1987.Google Scholar
  9. [9]
    Hoare, C.A.R., ‘A Calculus of Total Correctness for Communicating Processes,’ Science of Computer Programming, Vol. 1, No. 1, 1981.Google Scholar
  10. [10]
    Leisenring, A., Mathematical Logic and Hilbert’s ∊-Symbol, Macdonald and Co. Ltd., London, 1969.Google Scholar
  11. [11]
    Winskel, G., ‘Lectures on models and logic of MOS circuits,’ Proceedings of the Marktoberdorf International Summer School on Logic Programming and Calculi of Discrete Design, July 1986.Google Scholar

Copyright information

© Kluwer Academic Publishers, Boston 1988

Authors and Affiliations

  • Thomas F. Melham
    • 1
  1. 1.Computer LaboratoryUniversity of CambridgeCambridgeEngland

Personalised recommendations