Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Toward a super duper hardware tactic

  • Conference paper
  • First Online:
Higher Order Logic Theorem Proving and Its Applications (HUG 1993)

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

Included in the following conference series:

Abstract

We present techniques for automating many of the tedious aspects of hardware verification in a higher order logic theorem proving environment. We employ two complementary approaches. The first involves intelligent tactics which incorporate many of the smaller steps currently applied by the user. The second uses hardware combinators to partially automate inductive proofs for iterated hardware structures. We envision a system that captures most of this reasoning in one tactic, SuperDuperHWTac. Ideally, users would use this tactic on a goal for proving that a hardware component meets its specification, and get back a proof documented at a level they would have written by hand. This paper presents preliminary work toward SuperDuperHWTac in both the HOL and Nuprl proof development-systems.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. M. D. Aagaard and M. E. Leeser. A methodology for reusable hardware proofs. In L. Claesen and M. Gordon, editors, HOL Theorem Proving System and its Applications. North-Holland, September 1992.

    Google Scholar 

  2. A. Camillieri, M. Gordon, and T. Melham. Hardware verification using higher-order logic. In D. Borrione, editor, From HDL Descriptions to Guaranteed Correct Circuit Designs. North Holland, September 1986.

    Google Scholar 

  3. F. K. Hanna, N. Daeche, and M. Longley. Specification and verification using dependent types. IEEE Trans. on Soft. Eng., 16(9):949–964, September 1990.

    Google Scholar 

  4. R. Kumar, T. Kropf, and K. Schneider. Integrating a first-order automatic prover in the HOL environment. In M. Archer and M. Gordon, editors, The HOL Theorem Proving System and its Applications, pages 170–176. IEEE Press, 1991.

    Google Scholar 

  5. M. E. Leeser. Using Nuprl for the verification and synthesis of hardware. In C. A. R. Hoare and M. J. C. Gordon, editors, Mechanized Reasoning and Hardware Design. Prentice-Hall International Series on Computer Science, 1992.

    Google Scholar 

  6. J. O'Leary et al. HML: a hardware description language based on SML. In D. Agnew and L. Claesen, editors, CHDL, Apr. 1993.

    Google Scholar 

  7. K. Schneider, R. Kumar, and T. Kropf. Structuring hardware proofs: First steps toward automation a higher order environment. In VLSI, 1991.

    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

Aagaard, M.D., Leeser, M.E., Windley, P.J. (1994). Toward a super duper hardware tactic. 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_151

Download citation

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

  • 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