Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Verification complexity reduction via range-preserving input-to-constant conversion

a range-preserving input and constant conversion technology, applied in the field of circuit verification techniques, can solve the problems of complex design, large and complex design complexity, and the complexity of complex verification of such complex systems has grown to be extremely challenging

Active Publication Date: 2020-01-16
IBM CORP
View PDF0 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

The invention is a method for verifying a logic design using a computer system. The method identifies a set of cut-nodes, which are output nodes of the logic design. These cut-nodes are then compared with a set of input RAND0MS (i.e., pseudo-random binary sequences) that can be merged with the cut-nodes without affecting the range of values producible at the cut-nodes. A constant is identified for each input RAND0M in the logic representation. The set of input RAND0MS is then replaced with the corresponding constant in the logic representation to merge the input RAND0MS. The verification of the logic across non-dominated RAND0MS and non-merged RAND0MS is then performed to complete the verification. The technical effect of this invention is improved efficiency and accuracy in verifying logic designs.

Problems solved by technology

Modern hardware, software, and hardware / software co-design components have become very large and complex, leading to an increasing diversity of functionality.
Such large and complex designs are further complicated by multi-dimensional optimization criteria including delay, area, and power optimizations, as well as the inclusion of additional logic to increase testability, reliability, and configurability.
The verification of such complex systems has grown to be extremely challenging if not intractable, with verification resource demands typically having eclipsed the cost of all other aspects of the production of such systems, while in addition frequently increasing the risk of missing subtle design flaws during verification.
Design flaws, particularly those that occur in dedicated hardware, can be very expensive to repair if exposed late in the product development cycle, causing product delays which may eliminate or decrease the profitability of a design, while risking damage due to erroneous computations, including risk to human lives.
Verification typically involves exponentially-growing complexity with respect to the size of the design under verification.
Some verification techniques are more seriously hindered by certain design components than others.
The number of gates in a design often imposes a significant impact on the complexity of analysis of the design functionality, since a large number of gates is typical of a more complicated functionality of the design.
Verification techniques that simulate logic to determine a set of reachable states of a design are typically greatly impacted by the number of state-retaining elements present in the design.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Verification complexity reduction via range-preserving input-to-constant conversion
  • Verification complexity reduction via range-preserving input-to-constant conversion
  • Verification complexity reduction via range-preserving input-to-constant conversion

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0017]This disclosure presents novel techniques that reduce the complexity of verification through reducing the size of the testbench. By merging certain primary inputs to constant values, constant propagation and other logic optimization techniques can be applied to further reduce testbench size and verification complexity. Specifically, the disclosed approach identifies the set of primary inputs which are dominated by certain intermediate nodes (dominator set) and determines whether the primary inputs can be merged to 0 / 1, i.e., replaced with a true or false constant value, by comparing range computations on the dominator set (i.e., the set of producible values at the dominator set), with and without candidate reductions. The methods disclosed herein can be considered as computing and comparing two ranges: first leaving the primary inputs intact, then re-computing after merging the primary inputs to either 0 / 1, and if these ranges are equal, the corresponding primary inputs may be...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

A logic verification program, method and system provide an efficient behavior when verifying large logic designs. The logic is partitioned by cut-nodes that dominate two or more RANDOMS and a check is performed for a given cut-node to determine whether any of the dominated RANDOMS can be merged to a constant by performing satisfiability checks with each RANDOM merged to a constant, to determine whether a range of output values for the given cut-node has been reduced by merging the RANDOM. If the range is not reduced, the RANDOM can be added to the set of merge-able RANDOMS along with the corresponding constant value. If the range has been reduced, the opposite constant value is tried for a node and if the range is reduced for both constants, then the cut-node is abandoned for merging that dominated RANDOM and the next dominated RANDOM is tried.

Description

BACKGROUND OF THE INVENTION1. Field of the Invention[0001]The present invention is related to circuit verification techniques that reduce computational and system memory burdens, and more specifically to logic verification programs, methods and systems that search out and remove dependencies on non-dominated, undefined input values in order to enhance circuit simulation, perform netlist reduction and perform other model simplification.2. Description of Related Art[0002]Modern hardware, software, and hardware / software co-design components have become very large and complex, leading to an increasing diversity of functionality. Such large and complex designs are further complicated by multi-dimensional optimization criteria including delay, area, and power optimizations, as well as the inclusion of additional logic to increase testability, reliability, and configurability. The verification of such complex systems has grown to be extremely challenging if not intractable, with verificati...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(United States)
IPC IPC(8): G06F17/50
CPCG06F17/505G06F2217/86G06F17/5022G06F30/327G06F30/33G06F2117/08
Inventor GAJAVELLY, RAJ KUMARBAUMGARTNER, JASON R.KANZELMAN, ROBERT L.IVRII, ALEXANDERNALLA, PRADEEP KUMAR
Owner IBM CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products