Skip to main content

The HOL-Voss system: Model-checking inside a general-purpose theorem-prover

  • Conference paper
  • First Online:

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

Abstract

We have extended the HOL theorem-prover with an efficient implementation of symbolic trajectory evaluation. Using this extension we can obtain verification results for models of digital hardware — usually with much less effort than would be required using a conventional interactive theorem-proving approach. We illustrate the use of this extension with three examples, namely, the formal verification of a 32-bit adder, an 8-bit by 8-bit multiplier and the MAJORLOGIC block of the Viper microprocessor.

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. Randal E. Bryant, “NET — simple network description language”, Carnegie-Mellon University, on-line documentation.

    Google Scholar 

  2. R.E. Bryant, “On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Applications to Integer Multiplication”, IEEE Transactions on Computers, Vol. C-40, No. 2, February 1991.

    Google Scholar 

  3. Avra Cohn, “Correctness Properties of the Viper Block Model: The Second Level”, in: G. Birtwistle and P. Subrahmanyam, eds., Current Trends in Hardware Verification and Automated Theorem Proving, Springer-Verlag, 1989, pp. 1–91. Also Report No. 134, Computer Laboratory, Cambridge University, May 1988.

    Google Scholar 

  4. M. J. C. Gordon and T. F. Melham (eds.,), Introduction to HOL: a theorem proving environment for higher order logic, Cambridge University Press, 1993.

    Google Scholar 

  5. David Hard et al. “STATEMATE: A Working Environment for the Development of Complex Reactive Systems”, IEEE Transactions on Software Engineering, Vol. 16, No. 4, April 1990, pp. 403–413.

    Google Scholar 

  6. Jeffrey J. Joyce and Carl-Johan H. Seger, “Linking BDD-Based Symbolic Evaluation to Interactive Theorem-Proving”, Proceedings of the 30th Design Automation Conference, IEEE Computer Press, June 14–18, 1993.

    Google Scholar 

  7. C-J. Seger and R. E. Bryant, “Formal Verification of Digital Circuits by Symbolic Evaluation of Partially-Ordered Trajectories”, in preparation.

    Google Scholar 

  8. C-J. Seger, “Voss — A Formal Verification System (User's Guide)”, Department of Computer Science, University of British Columbia, in preparation.

    Google Scholar 

  9. Carl-Johan H. Seger and Jeffrey J. Joyce, “A Mathematically Precise Two-Level Formal Hardware Verification Methodology”, Department of Computer Science, University of British Columbia, April 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jeffrey J. Joyce Carl-Johan H. Seger

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Joyce, J., Seger, C. (1994). The HOL-Voss system: Model-checking inside a general-purpose theorem-prover. In: Joyce, J.J., Seger, CJ.H. (eds) Higher Order Logic Theorem Proving and Its Applications. HUG 1993. Lecture Notes in Computer Science, vol 780. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57826-9_135

Download citation

  • DOI: https://doi.org/10.1007/3-540-57826-9_135

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57826-0

  • Online ISBN: 978-3-540-48346-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics