Skip to main content

Combining Equivalence Verification and Completion Functions

  • Conference paper

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

Abstract

This work presents a new method for verifying optimized register-transfer-level implementations of pipelined circuits. We combine the robust, yet limited, capabilities of combinational equivalence verification with the modular and composable verification strategy of completion functions. We have applied this technique to a 32-bit OpenRISC processor and a Sobel edge-detector circuit. Each case study required less than fifteen verification obligations and each obligation could be checked in less than one minute. We believe that our approach will be applicable to a large class of pipelines with in-order execution.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berezin, S., Clarke, E.M., Biere, A., Zhu, Y.: Verification of out-of-order processor designs using model checking. Formal Methods in System Design 20(2), 159–186 (2002)

    Article  MATH  Google Scholar 

  2. Burch, J.R., Dill, D.L.: Automatic verification of pipelined microprocessor control. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 68–70. Springer, Heidelberg (1994)

    Google Scholar 

  3. Hosabettu, R., Gopalakrishnan, G., Srivas, M.: Formal verification of a complex pipelined processor. Formal Methods in System Design 23(2), 171–213 (2003)

    Article  MATH  Google Scholar 

  4. OpenCores. OpenRISC 1000 Architecture Manual (2003)

    Google Scholar 

  5. Synopsys, Inc. Synopsys Formality Data Sheet (2004)

    Google Scholar 

  6. Velev, M.: Using rewriting rules and positive equality to formally verify wide-issue out-oforder microprocessors with a reorder buffer. In: DATE, pp. 28–35 (March 2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aagaard, M.D., Ciubotariu, V.C., Higgins, J.T., Khalvati, F. (2004). Combining Equivalence Verification and Completion Functions. In: Hu, A.J., Martin, A.K. (eds) Formal Methods in Computer-Aided Design. FMCAD 2004. Lecture Notes in Computer Science, vol 3312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30494-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30494-4_8

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30494-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics