发明名称 |
SOLVING MULTIPLICATION CONSTRAINTS BY FACTORIZATION |
摘要 |
A design description for verification includes a set of constraints on random variables within the design description. The set of constraints includes at least one multiplication constraint involving at least two random variables. A computer-based tool obtains designs and analyzes the design description to find the set of constraints and identify the multiplication constraint. The computer-based tool then performs factorization to solve for the multiplication constraint and to determine a set of potentially valid factoring values for the random variables used in the multiplication constraint. The design problem is then solved by the computer-based tool using the factoring values. If two multiplication constraints involve a common variable, the factorization finds a set of common factoring values between the two multiplication constraints to use for the common variable. |
申请公布号 |
US2014282316(A1) |
申请公布日期 |
2014.09.18 |
申请号 |
US201313802450 |
申请日期 |
2013.03.13 |
申请人 |
SYNOPSYS, INC. |
发明人 |
Korthikanti Vijay Anand;Goswami Dhiraj |
分类号 |
G06F17/50 |
主分类号 |
G06F17/50 |
代理机构 |
|
代理人 |
|
主权项 |
1. A computer-implemented method for verification analysis comprising:
obtaining a design description including a set of constraints wherein the set of constraints includes a multiplication constraint; analyzing the set of constraints to identify the multiplication constraint; performing factorization of a number to produce factoring values that solve the multiplication constraint; and solving a design problem within the design description based on the factoring values. |
地址 |
Mountain View CA US |