Skip to main content
SpringerLink
Log in

Experiments in automating hardware verification using inductive proof planning

  • Conference paper
  • First Online:
Formal Methods in Computer-Aided Design (FMCAD 1996)

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

Included in the following conference series:

Abstract

We present a new approach to automating the verification of hardware designs based on planning techniques. A database of methods is developed that combines tactics, which construct proofs, using specifications of their behaviour. Given a verification problem, a planner uses the method database to build automatically a specialised tactic to solve the given problem. User interaction is limited to specifying circuits and their properties and, in some cases, suggesting lemmas. We have implemented our work in an extension of the Clam proof planning system. We report on this and its application to verifying a variety of combinational and synchronous sequential circuits including a parameterised multiplier design and a simple computer microprocessor.

Supported by CONACYT grant 500100-5-3533A

Supported by EPSRC grant GR/J/80702

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. David Basin and Toby Walsh. Annotated Rewriting in Inductive Theorem Proving. Journal of Automated Reasoning, 16:147–180, 1996.

    Google Scholar 

  2. Richard J. Boulton. Efficiency in a fully-expansive theorem prover. Technical Report 337, University of Cambridge Computer Laboratory, 1994.

    Google Scholar 

  3. R.S. Boyer and J.S. Moore. A Computational Logic. Academic Press, 1979.

    Google Scholar 

  4. A. Bundy. The use of explicit plans to guide inductive proofs. In proc. of the 9th Conference on Automated Deduction, pp 111–120. Springer-Verlag, 1988.

    Google Scholar 

  5. A. Bundy and M. Gordon. Automatic Guidance of Mechanically Generated Proofs. Research proposal, Edinburgh-Cambridge, 1995.

    Google Scholar 

  6. A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill. Rippling: A Heuristic for Guiding Inductive Proofs. Artificial Intelligence, 62:185–253, 1993.

    Google Scholar 

  7. A. Bundy, F. van Harmelen, J. Hesketh, and A. Smaill. Experiments with Proof Plans for Induction. Journal of Automated Reasoning, 7:303–324, 1991.

    Google Scholar 

  8. A. Bundy, F. van Harmelen, C. Horn, and A. Smaill. The Oyster-Clam system. In M.E. Stickel, editor, 10th International Conference on Automated Deduction, pages 647–648. Springer-Verlag, 1990. Lecture Notes in Artificial Intelligence 449.

    Google Scholar 

  9. Francisco J. Cantu. Inductive Proof Planning for Automating Hardware Verification. PhD thesis, University of Edinburgh, 1996. Forthcoming.

    Google Scholar 

  10. D. Cyrluk, N. Rajan, N. Shankar, and M.K. Srivas. Effective Theorem Proving for Hardware Verification. In 2nd TPCD Conference, Springer-Verlag, 1994.

    Google Scholar 

  11. Warren Hunt. FM8501: A Verified Microprocessor. Technical report 47, Institute for Computing Science, University of Texas at Austin, 1986.

    Google Scholar 

  12. Jeff Joyce, G. Graham Birtwistle, and M. Gordon. Proving a Computer Correct in Higher-order Logic. Tech. Report 100, U. of Cambridge Computer Lab., 1986.

    Google Scholar 

  13. Jeffrey J. Joyce. Multi-level Verification of Microprocessor-based Systems. Technical Report 195, University of Cambridge Computer Laboratory, 1990.

    Google Scholar 

  14. M. Morris Mano. Digital Logic and Computer Design. Prentice Hall, Inc, 1979.

    Google Scholar 

  15. S. Owre, J.M. Rushby, N. Shankar, and M.K. Srivas. A Tutorial on Using pvs for Hardware Verification. In 2nd TPCD Conference, Springer-Verlag, 1994.

    Google Scholar 

  16. Victor Rangel. Metodos Formales para Verificacion de Hardware: Un Estudio Comparativo. Master's thesis, Instituto Tecnologico de Monterrey, Mexico, 1996.

    Google Scholar 

  17. V. Stavridou, H. Barringer, and D.A. Edwards. Formal specification and verification of hardware: A comparative case study. In Proceedings of the 25th ACM/IEEE Design Automation Conference, pages 89–96. IEEE, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Artificial Intelligence, ITESM, Mexico

    Francisco J. Cantu

  2. Department of Artificial Intelligence, University of Edinburgh, UK

    Alan Bundy & Alan Smaill

  3. Max-Planck-Institut für Informatik, Saarbrücken, Germany

    David Basin

Authors
  1. Francisco J. Cantu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan Bundy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alan Smaill
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. David Basin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mandayam Srivas Albert Camilleri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cantu, F.J., Bundy, A., Smaill, A., Basin, D. (1996). Experiments in automating hardware verification using inductive proof planning. In: Srivas, M., Camilleri, A. (eds) Formal Methods in Computer-Aided Design. FMCAD 1996. Lecture Notes in Computer Science, vol 1166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031802

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61937-6

  • Online ISBN: 978-3-540-49567-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation