Search Results

Filters
Reset All

Filters

Topic

Show More

Show Less

Content Type

Show More

Show Less

Audience

Resource Type

Show More

Show Less

Tags

Show More

Show Less

1983 Results

  • Intelligent Testbench Automation with UVM and Questa

    This article describes an automated approach to improve design coverage by utilizing genetic algorithms added to standard UVM verification environments running in Questa. To demonstrate the effectiveness of the approach, the article will utilize real-world data from the verification of a 32-bit ASIP Codasip® processor.

  • Unit Testing Your Way to a Reliable Testbench

    Writing tests, particularly unit tests, can be a tedious chore. More tedious - not to mention frustrating - is debugging testbench code as project schedules tighten and release pressure builds. With quality being a non-negotiable aspect of hardware development, verification is a pay-me-now or pay-me-later activity that cannot be avoided.

  • Hardware Emulation: Three Decades of Evolution – Part II

    In the second decade, the hardware emulation landscape changed considerably with a few mergers and acquisitions and new players entering the market. The hardware emulators improved notably via new architectures based on custom ASICs.

  • Accelerating RTL Simulation Techniques

    Long simulation run times are a bottleneck in the verification process. Coding style has a significant effect on simulation run times. Therefore, it is imperative that the code writer examine his/her code, not only by asking the question “does the code produce the desired output?” but also “is the code economical, and if not, what can be done to improve it?”

  • Emulation Based Approach to ISO 26262 Compliant Processors Design

    This article reviews the use of processors in the automotive industry, the origin of faults in processors, architectures of fault tolerant processors and techniques for processor verification with fault injection. We then propose an emulation-based framework for performing fault-injection experiments on embedded processor architectures.

  • Resolving the Limitations of a Traditional VIP for PHY Verification

    This article describes the limitations of a traditional VIP for PHY verification, which can typically be resolved using an exclusive PHY verification kit. The common PHY found in PCI Express, USB 3.0 and 3.1, and SATA devices help accelerate development of these devices by implementing the physical layer functionality as a discreet IC or macro cell, which can be easily included in ASIC designs.

  • Automatic Formal Solutions

    After a brief introductory session outlining the general architecture of formal apps, in each subsequent session of this track will deep dive on a specific verification challenge and the corresponding formal application.

  • Introduction to Automated Formal Apps

    This session will introduce you to Formal Apps; what they are, how they are structured and what is available today.

  • AutoCheck: Push-Button Bug Hunting

    This session will show how automation of assertion based methods via automated formal analysis can uncover numerous types of RTL behavioral issues, enabling immediate fixes as the RTL is being developed without the need for a testbench.

  • Formal-Based Technology

    This track introduces basic concepts and terminology that should be useful by any engineer wishing to mature their formal-based technology skills.

  • Connectivity Check: Connectivity Verification

    This session we’ll take a quick look at the various challenges in doing connectivity verification with current methods. We’ll also look at a number of connectivity checking applications.

  • Formal Concepts and Solutions

    This session focuses on formal verification concepts and solutions.

  • Questa AutoCheck

    This session will demo the Questa AutoCheck tool and will review features including the details window, design checks window, source, waveform, schematic, and fsm debug features.

  • Formal Use Models and Organization Skills

    This session focuses on formal-based technology use models, and organization guidelines for adopting advanced formal property checking.

  • Questa Connectivity Check

    This session will demo assertions and results and a quick debug showing the QFL waveforms using Questa® Connectivity Check.

  • CoverCheck: Accelerating Coverage Closure

    This session will show how automated formal techniques can be used to keep the project moving forward by exhaustively determining the reachability or unreachability of coverage elements, grant persistent waivers to areas that can be safely excluded, and how the master coverage database can be automatically updated with the current coverage score.

  • Formal Assertion-Based Verification

    In this track, you will learn how to get started with direct property checking including: test planning for formal, SVA coding tricks that get the most out of the formal analysis engines.

  • Questa CoverCheck

    This session will demo the Questa CoverCheck tool and will review features including the details window, coverage checks window, and source debug features.

  • Register Check: Memory Mapped Register Verification

    In this session we’ll take a quick overview of memory mapped verification and some of the challenges users face with verifying these design constructs.

  • Introduction to Formal Assertion-Based Verification

    In this session we will learn about various formal verification techniques; what they are, how to utilize them, and benefits received from advanced formal technologies.

  • Formal Assertion-Based Verification Introduction & Overview

  • Questa Register Check

    This session will demo memory mapped register checkers generated results that can be debugged in the using Questa Register Check.

  • Formal Model Checking

    In this session we'll share some basic tips for getting started with direct property checking, how to setup the analysis for rapidly reaching a solution, and how to answer the question, “Do I have enough assertions?"

  • Basic Formal Closure, (Black Boxing and Cutpoint)

  • Basic Formal Closure (Black Boxing and Cutpoint)

    At some point formal engines will begin to struggle under the weight of the state space. This session will show two simple techniques to safely limit the states the engines need to process, enabling more in-depth results.