ADAPTIVE STATE-TO-SYMBOLIC TRANSFORMATION IN A CANONICAL REPRESENTATION
    1.
    发明申请
    ADAPTIVE STATE-TO-SYMBOLIC TRANSFORMATION IN A CANONICAL REPRESENTATION 有权
    自适应状态对符号变换在一个经典的代表

    公开(公告)号:US20100275169A1

    公开(公告)日:2010-10-28

    申请号:US12430322

    申请日:2009-04-27

    IPC分类号: G06F17/50

    CPC分类号: G06F17/504

    摘要: Some embodiments provide a system for adaptively performing state-to-symbolic transformation in a canonical representation which is used for generating random stimulus for a constrained-random simulation. The system can construct a canonical representation for a set of constraints using the set of random variables and the subset of the state variables in the constraints. Next, the system can use the canonical representation to generate random stimulus for the constrained-random simulation, and monitor parameters associated with the constrained-random simulation. Next, the system can add state variables to or remove state variables from the canonical representation based at least on the monitored parameters. The system can then use the modified canonical representation which has a different set of state variables to generate random stimulus for the constrained-random simulation.

    摘要翻译: 一些实施例提供了一种用于在规范表示中自适应地执行状态到符号变换的系统,其用于生成用于约束随机模拟的随机刺激。 系统可以使用随机变量集合和约束中的状态变量的子集来构造一组约束的规范表示。 接下来,系统可以使用规范表示来生成用于约束随机模拟的随机激励,并且监视与约束随机模拟相关联的参数。 接下来,系统可以至少基于所监视的参数将状态变量添加到规范表示中或从规范表示中移除状态变量。 然后,系统可以使用具有不同状态变量集合的修改的规范表示来生成用于约束随机模拟的随机刺激。

    Adaptive state-to-symbolic transformation in a canonical representation
    2.
    发明授权
    Adaptive state-to-symbolic transformation in a canonical representation 有权
    规范表示中的自适应状态到符号转换

    公开(公告)号:US08099690B2

    公开(公告)日:2012-01-17

    申请号:US12430322

    申请日:2009-04-27

    IPC分类号: G06F17/50

    CPC分类号: G06F17/504

    摘要: Some embodiments provide a system for adaptively performing state-to-symbolic transformation in a canonical representation which is used for generating random stimulus for a constrained-random simulation. The system can construct a canonical representation for a set of constraints using the set of random variables and the subset of the state variables in the constraints. Next, the system can use the canonical representation to generate random stimulus for the constrained-random simulation, and monitor parameters associated with the constrained-random simulation. Next, the system can add state variables to or remove state variables from the canonical representation based at least on the monitored parameters. The system can then use the modified canonical representation which has a different set of state variables to generate random stimulus for the constrained-random simulation.

    摘要翻译: 一些实施例提供了一种用于在规范表示中自适应地执行状态到符号变换的系统,其用于生成用于约束随机模拟的随机刺激。 系统可以使用随机变量集合和约束中的状态变量的子集来构造一组约束的规范表示。 接下来,系统可以使用规范表示来生成用于约束随机模拟的随机激励,并且监视与约束随机模拟相关联的参数。 接下来,系统可以至少基于所监视的参数将状态变量添加到规范表示中或从规范表示中移除状态变量。 然后,系统可以使用具有不同状态变量集合的修改的规范表示来生成用于约束随机模拟的随机刺激。

    Optimizing constraint solving by rewriting at least one modulo constraint
    3.
    发明授权
    Optimizing constraint solving by rewriting at least one modulo constraint 有权
    通过重写至少一个模约束来优化约束求解

    公开(公告)号:US09195634B2

    公开(公告)日:2015-11-24

    申请号:US12967294

    申请日:2010-12-14

    IPC分类号: G06F17/10 G06F17/11

    摘要: Methods and apparatuses are described for assigning random values to a set of random variables so that the assigned random values satisfy a set of constraints. A constraint solver can receive a set of constraints that is expected to cause performance problems when the system assigns random values to the set of random variables in a manner that satisfies the set of constraints. For example, modulo constraints and bit-slice constraints can cause the system to perform excessive backtracking when the system attempts to assign random values to the set of random variables in a manner that satisfies the set of constraints. The system can rewrite the set of constraints to obtain a new set of constraints that is expected to reduce and/or avoid the performance problems. The system can then assign random values to the set of random variables based on the new set of constraints.

    摘要翻译: 描述用于将随机值分配给一组随机变量的方法和装置,使得分配的随机值满足一组约束。 约束求解器可以接收一组约束,当系统以满足约束集合的方式将随机值分配给随机变量集合时,预期会导致性能问题。 例如,当系统尝试以满足约束集合的方式将随机值分配给随机变量集时,模约束和位片约束可导致系统执行过多的回溯。 系统可以重写一组约束以获得预期会减少和/或避免性能问题的新的一组约束。 然后,系统可以基于新的约束集将随机值分配给随机变量集合。

    METHOD AND APPARATUS FOR OPTIMIZING CONSTRAINT SOLVING THROUGH CONSTRAINT REWRITING AND DECISION REORDERING
    4.
    发明申请
    METHOD AND APPARATUS FOR OPTIMIZING CONSTRAINT SOLVING THROUGH CONSTRAINT REWRITING AND DECISION REORDERING 有权
    通过约束条件和决策权重优化约束的方法和装置

    公开(公告)号:US20120136635A1

    公开(公告)日:2012-05-31

    申请号:US12967294

    申请日:2010-12-14

    IPC分类号: G06F17/50

    摘要: Methods and apparatuses are described for assigning random values to a set of random variables so that the assigned random values satisfy a set of constraints. A constraint solver can receive a set of constraints that is expected to cause performance problems when the system assigns random values to the set of random variables in a manner that satisfies the set of constraints. For example, modulo constraints and bit-slice constraints can cause the system to perform excessive backtracking when the system attempts to assign random values to the set of random variables in a manner that satisfies the set of constraints. The system can rewrite the set of constraints to obtain a new set of constraints that is expected to reduce and/or avoid the performance problems. The system can then assign random values to the set of random variables based on the new set of constraints.

    摘要翻译: 描述用于将随机值分配给一组随机变量的方法和装置,使得分配的随机值满足一组约束。 约束求解器可以接收一组约束,当系统以满足约束集合的方式将随机值分配给随机变量集合时,预期会导致性能问题。 例如,当系统尝试以满足约束集合的方式将随机值分配给随机变量集时,模约束和位片约束可导致系统执行过多的回溯。 系统可以重写一组约束以获得预期会减少和/或避免性能问题的新的一组约束。 然后,系统可以基于新的约束集将随机值分配给随机变量集合。

    Method and apparatus for constructing a canonical representation
    5.
    发明授权
    Method and apparatus for constructing a canonical representation 有权
    用于构建规范表示的方法和装置

    公开(公告)号:US08370273B2

    公开(公告)日:2013-02-05

    申请号:US12361318

    申请日:2009-01-28

    IPC分类号: G06F15/18

    CPC分类号: G06F17/504

    摘要: Some embodiments provide systems and techniques to facilitate construction of a canonical representation (CR) which represents a logical combination of a set of logical functions. During operation, the system can receive a CR-size limit. Next, the system can construct a set of CRs based on the set of logical functions, wherein each CR in the set of CRs represents a logical function in the set of logical functions. The system can then combine a subset of the set of CRs to obtain a combined CR. Next, the system can identify a problematic CR which when combined with the combined CR causes the CR-size limit to be exceeded. The system can then report the problematic CR and/or a logical function associated with the problematic CR to a user, thereby helping the user to identify an error in the set of logical functions.

    摘要翻译: 一些实施例提供了系统和技术,以便于构建代表一组逻辑功能的逻辑组合的规范表示(CR)。 在操作期间,系统可以接收CR大小限制。 接下来,系统可以基于逻辑功能集合来构建一组CR,其中CR集合中的每个CR表示该组逻辑功能中的逻辑功能。 然后,系统可以组合一组CR的子集以获得组合的CR。 接下来,系统可以识别有问题的CR,当与组合的CR组合时,CR将超过CR大小限制。 然后,系统可以向用户报告有问题的CR和/或与有问题的CR相关联的逻辑功能,从而帮助用户识别该组逻辑功能中的错误。

    METHOD AND APPARATUS FOR CONSTRUCTING A CANONICAL REPRESENTATION
    6.
    发明申请
    METHOD AND APPARATUS FOR CONSTRUCTING A CANONICAL REPRESENTATION 有权
    用于构建统一表示的方法和装置

    公开(公告)号:US20100191679A1

    公开(公告)日:2010-07-29

    申请号:US12361318

    申请日:2009-01-28

    IPC分类号: G06F15/18

    CPC分类号: G06F17/504

    摘要: Some embodiments provide systems and techniques to facilitate construction of a canonical representation (CR) which represents a logical combination of a set of logical functions. During operation, the system can receive a CR-size limit. Next, the system can construct a set of CRs based on the set of logical functions, wherein each CR in the set of CRs represents a logical function in the set of logical functions. The system can then combine a subset of the set of CRs to obtain a combined CR. Next, the system can identify a problematic CR which when combined with the combined CR causes the CR-size limit to be exceeded. The system can then report the problematic CR and/or a logical function associated with the problematic CR to a user, thereby helping the user to identify an error in the set of logical functions.

    摘要翻译: 一些实施例提供了系统和技术,以便于构建代表一组逻辑功能的逻辑组合的规范表示(CR)。 在操作期间,系统可以接收CR大小限制。 接下来,系统可以基于逻辑功能集合来构建一组CR,其中CR集合中的每个CR表示该组逻辑功能中的逻辑功能。 然后,系统可以组合一组CR的子集以获得组合的CR。 接下来,系统可以识别有问题的CR,当与组合的CR组合时,CR将超过CR大小限制。 然后,系统可以向用户报告有问题的CR和/或与有问题的CR相关联的逻辑功能,从而帮助用户识别该组逻辑功能中的错误。

    Identifying inconsistent constraints
    7.
    发明授权
    Identifying inconsistent constraints 有权
    识别不一致的约束

    公开(公告)号:US09069699B2

    公开(公告)日:2015-06-30

    申请号:US13074940

    申请日:2011-03-29

    CPC分类号: G06F17/11 G06F17/5018

    摘要: Methods and apparatuses are described for identifying inconsistent constraints. During operation, a system can receive a set of constraints, wherein each constraint is defined over one or more random variables from a set of random variables. If an inconsistency or conflict is detected while solving the set of constraints, the system can identify a phase in a series of phases of the constraint solver where the inconsistency was detected. The system can then try to solve different subsets of the set of constraints to identify smaller subsets of the set of constraints that contain the inconsistency. When the system tries to solve a subset of the set of constraints, the system can determine whether or not an inconsistency is detected in the identified phase while solving the subset of the set of constraints. Next, the system can report the smallest subset of inconsistent constraints that was found to a user.

    摘要翻译: 描述了用于识别不一致约束的方法和装置。 在操作期间,系统可以接收一组约束,其中每个约束被从一组随机变量的一个或多个随机变量上定义。 如果在解决一组约束的同时检测到不一致或冲突,则系统可以识别在检测到不一致的约束求解器的一系列阶段中的阶段。 系统然后可以尝试解决该组约束的不同子集以识别包含不一致性的约束集合的较小子集。 当系统尝试解决约束集合的子集时,系统可以确定在确定的相位集合中是否检测到不一致性,同时解决该组约束的子集。 接下来,系统可以报告对用户发现的不一致约束的最小子集。

    METHOD AND APPARATUS FOR IDENTIFYING INCONSISTENT CONSTRAINTS
    8.
    发明申请
    METHOD AND APPARATUS FOR IDENTIFYING INCONSISTENT CONSTRAINTS 有权
    识别不确定性约束的方法和装置

    公开(公告)号:US20120253754A1

    公开(公告)日:2012-10-04

    申请号:US13074940

    申请日:2011-03-29

    IPC分类号: G06F17/11

    CPC分类号: G06F17/11 G06F17/5018

    摘要: Methods and apparatuses are described for identifying inconsistent constraints. During operation, a system can receive a set of constraints, wherein each constraint is defined over one or more random variables from a set of random variables. If an inconsistency or conflict is detected while solving the set of constraints, the system can identify a phase in a series of phases of the constraint solver where the inconsistency was detected. The system can then try to solve different subsets of the set of constraints to identify smaller subsets of the set of constraints that contain the inconsistency. When the system tries to solve a subset of the set of constraints, the system can determine whether or not an inconsistency is detected in the identified phase while solving the subset of the set of constraints. Next, the system can report the smallest subset of inconsistent constraints that was found to a user.

    摘要翻译: 描述了用于识别不一致约束的方法和装置。 在操作期间,系统可以接收一组约束,其中每个约束被从一组随机变量的一个或多个随机变量上定义。 如果在解决一组约束的同时检测到不一致或冲突,则系统可以识别在检测到不一致的约束求解器的一系列阶段中的阶段。 系统然后可以尝试解决该组约束的不同子集,以识别包含不一致性的约束集合的较小子集。 当系统尝试解决约束集合的子集时,系统可以确定在所确定的阶段中是否检测到不一致性,同时解决该组约束的子集。 接下来,系统可以报告对用户发现的不一致约束的最小子集。

    Information theoretic caching for dynamic problem generation in constraint solving

    公开(公告)号:US09720792B2

    公开(公告)日:2017-08-01

    申请号:US13596776

    申请日:2012-08-28

    IPC分类号: G06F17/50 G06F11/263

    CPC分类号: G06F11/263 G06F17/5022

    摘要: Computer-implemented techniques are disclosed for verifying circuit designs using dynamic problem generation. A device under test (DUT) is modeled as part of a test bench where the test bench is a random process. A set of constraints is solved to generate stimuli for the DUT. Problem generation is repeated numerous times throughout a verification process with problems and sub-problems being generated and solved. When a problem is solved, the problem structure can be stored in a cache. The storage can be based on entropy of variables used in the problem. The problem storage cache can be searched for previously stored problems which match a current problem. By retrieving a problem structure from cache, the computational burden is reduced during verification. Problems can be multi-phase problems with storage and retrieval of problem structures based on the phase level. Caching can be accomplished using an information theoretic approach.

    INFORMATION THEORETIC CACHING FOR DYNAMIC PROBLEM GENERATION IN CONSTRAINT SOLVING
    10.
    发明申请
    INFORMATION THEORETIC CACHING FOR DYNAMIC PROBLEM GENERATION IN CONSTRAINT SOLVING 有权
    信息解决方案中动态问题产生的理论缓存

    公开(公告)号:US20140067356A1

    公开(公告)日:2014-03-06

    申请号:US13596776

    申请日:2012-08-28

    IPC分类号: G06F17/50

    CPC分类号: G06F11/263 G06F17/5022

    摘要: Computer-implemented techniques are disclosed for verifying circuit designs using dynamic problem generation. A device under test (DUT) is modeled as part of a test bench where the test bench is a random process. A set of constraints is solved to generate stimuli for the DUT. Problem generation is repeated numerous times throughout a verification process with problems and sub-problems being generated and solved. When a problem is solved, the problem structure can be stored in a cache. The storage can be based on entropy of variables used in the problem. The problem storage cache can be searched for previously stored problems which match a current problem. By retrieving a problem structure from cache, the computational burden is reduced during verification. Problems can be multi-phase problems with storage and retrieval of problem structures based on the phase level. Caching can be accomplished using an information theoretic approach.

    摘要翻译: 公开了用于验证使用动态问题产生的电路设计的计算机实现的技术。 被测设备(DUT)被建模为测试台的一部分,其中测试台是随机过程。 解决了一组约束以产生DUT的刺激。 问题产生在整个验证过程中重复了很多次,产生和解决了问题和子问题。 当问题解决时,问题结构可以存储在缓存中。 存储可以基于问题中使用的变量的熵。 问题存储缓存可以搜索与当前问题匹配的先前存储的问题。 通过从缓存中检索问题结构,在验证过程中减少了计算负担。 问题可以是基于相位级存储和检索问题结构的多阶段问题。 可以使用信息理论方法来实现缓存。