Skip to main content

Asynchronous Assertions !!!

  • Chapter
  • First Online:
SystemVerilog Assertions and Functional Coverage
  • 4107 Accesses

Abstract

So far in the book we have always used a synchronous clock edge as the sampling edge for the assertion. That is for good reason. The example presented here uses an asynchronous edge (perfectly legal) as the sampling edge. The problem statement goes something like “whenever (i.e. asynchronously) L2TxData==L2ErrorData that L2Abort is asserted”. Now that looks very logical to implement without the need for a clock. So, we write a property as shown in the Fig. 15.1. We simply say that @ (L2TxData) (i.e. whenever L2TxData changes) that we compare L2TxData == L2ErrorData and if that matches we imply that L2Abort == 1.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ashok B. Mehta .

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this chapter

Cite this chapter

Mehta, A.B. (2014). Asynchronous Assertions !!! . In: SystemVerilog Assertions and Functional Coverage. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7324-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-7324-4_15

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-7323-7

  • Online ISBN: 978-1-4614-7324-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics