Home > Store

Hardware Design Verification: Simulation and Formal Method-Based Approaches

Register your product to gain access to bonus material or receive a coupon.

Hardware Design Verification: Simulation and Formal Method-Based Approaches

Alternate Binding

  • Sorry, this book is no longer in print.
Not for Sale

About

Features

Broad coverage of digital design verification delivered in an organized and systematic fashion.

° Covers the technology the industry uses for design verification, namely simulation based verification.

° Introduces formal verification, an emerging technology that is beginning to get into practice.

° Written by a senior engineering manager at Sun Microsystems Laboratories and winner of 2002 Sun Microsystem's Chairman's Award for Innovation (highest award for technical achievement).

Description

  • Copyright 2005
  • Dimensions: 7" x 9-1/4"
  • Pages: 624
  • Edition: 1st
  • Alternate Binding
  • ISBN-10: 0-13-701092-3
  • ISBN-13: 978-0-13-701092-9

The Practical, Start-to-Finish Guide to Modern Digital Design Verification

As digital logic designs grow larger and more complex, functional verification has become the number one bottleneck in the design process. Reducing verification time is crucial to project success, yet many practicing engineers have had little formal training in verification, and little exposure to the newest solutions. Hardware Design Verification systematically presents today's most valuable simulation-based and formal verification techniques, helping test and design engineers choose the best approach for each project, quickly gain confidence in their designs, and move into fabrication far more rapidly. College students will find that coverage of verification principles and common industry practices will help them prepare for jobs as future verification engineers.

Author William K. Lam, one of the world's leading experts in design verification, is a recent winner of the Chairman's Award for Innovation, Sun Microsystems' most prestigious technical achievement award. Drawing on his wide-ranging experience, he introduces the foundational principles of verification, presents traditional techniques that have survived the test of time, and introduces emerging techniques for today's most challenging designs. Throughout, Lam emphasizes practical examples rather than mathematical proofs; wherever advanced math is essential, he explains it clearly and accessibly.

Coverage includes

  • Simulation-based versus formal verification: advantages, disadvantages, and tradeoffs
  • Coding for verification: functional and timing correctness, syntactical and structure checks, simulation performance, and more
  • Simulator architectures and operations, including event-driven, cycle-based, hybrid, and hardware-based simulators
  • Testbench organization, design, and tools: creating a fast, efficient test environment
  • Test scenarios and assertion: planning, test cases, test generators, commercial and Verilog assertions, and more
  • Ensuring complete coverage, including code, parameters, functions, items, and cross-coverage
  • The verification cycle: failure capture, scope reduction, bug tracking, simulation data dumping, isolation of underlying causes, revision control, regression, release mechanisms, and tape-out criteria
  • An accessible introduction to the mathematics and algorithms of formal verification, from Boolean functions to state-machine equivalence and graph algorithms
  • Decision diagrams, equivalence checking, and symbolic simulation
  • Model checking and symbolic computation

Simply put, Hardware Design Verification will help you improve and accelerate your entire verification process--from planning through tape-out--so you can get to market faster with higher quality designs.

Sample Content

Table of Contents

Preface xvii Acknowledgments xxiii About the Author xxv Chapter 1 An Invitation to Design Verification 1

1.1 What Is Design Verification? 2

1.2 The Basic Verification Principle 4

1.3 Verification Methodology 8

1.4 Simulation-Based Verification versus Formal Verification 15

1.5 Limitations of Formal Verification 17

1.6 A Quick Overview of Verilog Scheduling and Execution Semantics 17

1.7 Summary 23

Chapter 2 Coding for Verification 25

2.1 Functional Correctness 27

2.2 Timing Correctness 39

2.3 Simulation Performance 44

2.4 Portability and Maintainability 52

2.5 "Synthesizability," "Debugability," and General Tool Compatibility 56

2.6 Cycle-Based Simulation 59

2.7 Hardware Simulation/Emulation 62

2.8 Two-State and Four-State Simulation 64

2.9 Design and Use of a Linter 66

2.10 Summary 67

2.11 Problems 67

Chapter 3 Simulator Architectures and Operations 73

3.1 The Compilers 74

3.2 The Simulators 79

3.3 Simulator Taxonomy and Comparison 108

3.4 Simulator Operations and Applications 112

3.5 Incremental Compilation 126

3.6 Summary 129

3.7 Problems 130

Chapter 4 Test Bench Organization and Design 137

4.1 Anatomy of a Test Bench and a Test Environment 137

4.2 Initialization Mechanism 142

4.3 Clock Generation and Synchronization 148

4.4 Stimulus Generation 155

4.5 Response Assessment 162

4.6 Verification Utility 183

4.7 Test Bench-to-Design Interface 195

4.8 Common Practical Techniques and Methodologies 196

4.9 Summary 204

4.10 Problems 204

Chapter 5 Test Scenarios, Assertions, and Coverage 211

5.1 Hierarchical Verification 214

5.2 Test Plan 217

5.3 Pseudorandom Test Generator 227

5.4 Assertions 232

5.5 SystemVerilog Assertions 248

5.6 Verification Coverage 259

5.7 Summary 279

5.8 Problems 280

Chapter 6 Debugging Process and Verification Cycle 287

6.1 Failure Capture, Scope Reduction, and Bug Tracking 288

6.2 Simulation Data Dumping 297

6.3 Isolation of Underlying Causes 300

6.4 Design Update and Maintenance: Revision Control 315

6.5 Regression, Release Mechanism, and Tape-out Criteria 318

6.6 Summary 321

6.7 Problems 322

Chapter 7 Formal Verification Preliminaries 331

7.1 Sets and Operations 332

7.2 Relation, Partition, Partially Ordered Set, and Lattice 334

7.3 Boolean Functions and Representations 342

7.4 Boolean Functional Operators 353

7.5 Finite-State Automata and Languages 359

7.6 Summary 380

7.7 Problems 381

Chapter 8 Decision Diagrams, Equivalence Checking, and Symbolic Simulation 387

8.1 Binary Decision Diagrams 388

8.2 Decision Diagram Variants 412

8.3 Decision Diagram-Based Equivalence Checking 424

8.4 Boolean Satisfiability 430

8.5 Symbolic Simulation 442

8.6 Summary 457

8.7 Problems 458

Chapter 9 Model Checking and Symbolic Computation 465

9.1 Properties, Specifications, and Logic 466

9.2 Property Checking 484

9.3 Symbolic Computation and Model Checking 494

9.4 Symbolic CTL Model Checking 513

9.5 Computational Improvements 524

9.6 Using Model-Checking Tools 529

9.7 Summary 531

9.8 Problems 531

Bibliography 539 Index 561

Updates

Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020