Skip to main content
SpringerLink
Log in
SpringerLink
Log in

A Brief Overview of HOL4

  • Conference paper
Theorem Proving in Higher Order Logics (TPHOLs 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5170))

Included in the following conference series:

Abstract

The HOLF proof assistant supports specification and proof in classical higher order logic. It is the latest in a long line of similar systems. In this short overview, we give an outline of the HOLF system and how it may be applied in formal verification.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barras, B.: Proving and computing in HOL. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol. 1869, pp. 17–37. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Bishop, S., Fairbairn, M., Norrish, M., Sewell, P., Smith, M., Wansbrough, K.: Rigorous specification and conformance testing techniques for network protocols, as applied to TCP, UDP, and Sockets. In: Proceedings of SIGCOMM. ACM Press, New York (2005)

    Google Scholar 

  3. Church, A.: A formulation of the Simple Theory of Types. Journal of Symbolic Logic 5, 56–68 (1940)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gordon, M.J.C., Hunt, W.A., Kaufmann, M., Reynolds, J.: An embedding of the ACL2 logic in HOL. In: Proceedings of ACL2 2006, ACM International Conference Proceeding Series, vol. 205, pp. 40–46. ACM Press, New York (2006)

    Google Scholar 

  5. Gordon, M.J.C., Reynolds, J., Hunt, W.A., Kaufmann, M.: An integration of HOL and ACL2. In: Proceedings of FMCAD 2006, pp. 153–160. IEEE Computer Society, Los Alamitos (2006)

    Google Scholar 

  6. Gordon, M., Melham, T.: Introduction to HOL, a theorem proving environment for higher order logic. Cambridge University Press, Cambridge (1993)

    MATH  Google Scholar 

  7. Li, G., Slind, K.: Compilation as rewriting in higher order logic. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603. Springer, Heidelberg (2007)

    Google Scholar 

  8. Myreen, M., Gordon, M.: Hoare logic for realistically modelled machine code. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Myreen, M., Slind, K., Gordon, M.: Machine-code verification for multiple architectures: An application of decompilation into logic. In: FMCAD 2008 (submitted 2008)

    Google Scholar 

  10. Norrish, M.: A formal semantics for C++. In: Informal proceedings of TTVSI 2008 (2008)

    Google Scholar 

  11. Norrish, M., Slind, K.: HOL-4 manuals (1998-2008), http://hol.sourceforge.net/

  12. Norrish, M., Slind, K.: A thread of HOL development. Computer Journal 45(1), 37–45 (2002)

    Article  MATH  Google Scholar 

  13. Owens, S.: A sound semantics for OCaml-Light. In: Proceedings of ESOP 2008. LNCS, vol. 4960. Springer, Heidelberg (2008)

    Google Scholar 

  14. Sewell, P., Nardelli, F., Owens, S., Peskine, G., Ridge, T., Sarkar, S., Strnisa, R.: Ott: Effective tool support for the working semanticist. In: Proceedings of ICFP 2007. ACM Press, New York (2007)

    Google Scholar 

  15. Slind, K., Owens, S., Iyoda, J., Gordon, M.: Proof producing synthesis of arithmetic and cryptographic hardware. Formal Aspects of Computing 19(3), 343–362 (2007)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, University of Utah, USA

    Konrad Slind

  2. National ICT, Australia

    Michael Norrish

Authors
  1. Konrad Slind
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Norrish
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, Concordia University, 1455 de Maisonneuve Blvd. W, H3G 1M8, Montreal, Quebec, Canada

    Otmane Ait Mohamed

  2. National Institute of Aerospace, 100 Exploration Way, VA 23666, Hampton, USA

    César Muñoz

  3. Dept. of Electrical & Computer Engineering, Concordia University, 1455 de Maisonette W, H3G 1M8, Montreal, Quebec, Canada

    Sofiène Tahar

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Slind, K., Norrish, M. (2008). A Brief Overview of HOL4. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2008. Lecture Notes in Computer Science, vol 5170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71067-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71067-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71065-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation