Skip to main content

Abstract

We present a method for formal proof of correctness of VLSI designs. Our approach is an adaptation of software verification techniques that works on circuit networks rather than program flowgraphs. The method may be viewed as a dual of Floyd’s method for program verification in which the roles of state and control are interchanged. We illustrate the approach with the semi-automatic verification of a simple NMOS design, and discuss its application to large scale VSLI designs. A proof of soundness of the method is presented in a forthcoming paper [ShS 83].

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Birman, A., “On Proving Correctness of Microprograms”, IBM J. Research and Development, vol.14, no. 3, May 1974, pp. 250–266.

    Article  MathSciNet  Google Scholar 

  2. Floyd, R. W., “Assigning Meanings to Programs”, Proc. Amer. Math. Soc. Symp. in Applied Math. 19 (1967), pp. 19–31.

    MathSciNet  Google Scholar 

  3. Foster, M. J., “Syntax-Directed Verification of Circuit Function”, VLSI Systems and Computations, H. Kung, B. Sproul, G. Steele, ed. Computer Science Press, Carnegie-Mellon University, 1981, pp. 203–212

    Google Scholar 

  4. Gordon, M., “Two Papers on Modelling and Verifying Hardware”, Proc. VLSI 81 International Conference, Edinburgh, Scotland, August 1981

    Google Scholar 

  5. Levitt, K., L. Robinson, B. Silverberg, “The HDM Handblook”, SRI International.

    Google Scholar 

  6. Mead, C., L. Conway, Introduction to VLSI Systems, Addison-Wesley, Philipines.

    Google Scholar 

  7. Miller, R., Switching Theory, vol. 2., Wiley, New York, 1965

    Google Scholar 

  8. Schwartz, R.L., P.M. Melliar-Smith, “Formal Specification and Mechanical Verification of SIFT: A Fault-tolerant Flight Control System”, TR CSL-133, SRI International, Menlo Park California, January 1982

    Google Scholar 

  9. Seitz, Charles L., “Self-timed VLSI Systems”, Proc. Caltech Conference on VLSI, January 1979

    Google Scholar 

  10. Shostak, R. E., “Deciding Combinations of Theories”, Proc. Sixth Conference on Automated Deduction, Courant Institute, New York, June 1982.

    Google Scholar 

  11. Shostak, R. E., R. L. Schwartz, P. M. Melliar-Smith, “STP: A Mechanized Logic for Specification and Verification”, Proc. Sixth Conference on Automated Deduction, Courant Institute, New York, June 1982

    Google Scholar 

  12. Shostak, R. E., “Formal Verification of Circuit Designs”, 6th International Symposium on Computer Hardware Description Languages and their Applications, Carnegie-Mellon University, Pittsburg, May 83

    Google Scholar 

  13. Wagner, T., “Hardware Verification”. Ph.D. Th., Dept. of Computer Science, Stanford University, September 1977

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Computer Science Press, Inc.

About this paper

Cite this paper

Shostak, R.E. (1983). Verification of VLSI Designs. In: Bryant, R. (eds) Third Caltech Conference on Very Large Scale Integration. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95432-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-95432-0_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12369-9

  • Online ISBN: 978-3-642-95432-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics