Summary
This chapter presented a tutorial on Verilog language elements applicable register transfer abstraction level and their verifiable use.
For verifiability, we emphasized strong typing and fully-specified state machines using case, casex and if-else statements. Since the Verilog X-state is counter-productive in RTL verification (see chapter 7), we omitted it.
We reviewed debugging statements, constant naming, code inclusion controls and command line options for compilation and simulation in a verification environment.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
(2002). Verifiable RTL Tutorial. In: Principles of Verifiable RTL Design. Springer, Boston, MA. https://doi.org/10.1007/0-306-47631-2_9
Download citation
DOI: https://doi.org/10.1007/0-306-47631-2_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-7368-1
Online ISBN: 978-0-306-47631-0
eBook Packages: Springer Book Archive