会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Method for retiming in the presence of verification constraints
    • 在存在验证约束的情况下重新定时的方法
    • US20060206842A1
    • 2006-09-14
    • US11077331
    • 2005-03-10
    • Jason BaumgartnerHari MonyViresh ParuthiJiazhao Xu
    • Jason BaumgartnerHari MonyViresh ParuthiJiazhao Xu
    • G06F17/50
    • G06F17/504
    • A method, system and computer program product for performing retiming in the presence of constraints are disclosed. The method comprises receiving an initial design containing one or more targets and one or more constraints and enumerating the one or more constraints and the one or more targets into a retiming gate set. A retiming graph is constructed from the initial design, and a retiming solution is obtained on the retiming graph. The retiming solution is normalized. One or more retiming lags from the retiming graph are propagated to the initial design, and the initial design is verified by using a constraint-satisfying analysis to determine whether the one or more targets may be hit while the one or more constraints are satisfied.
    • 公开了一种用于在存在约束的情况下执行重新定时的方法,系统和计算机程序产品。 该方法包括接收包含一个或多个目标和一个或多个约束的初始设计,并将一个或多个约束和一个或多个目标列举到重定时门组中。 从初始设计构建重新定时图,并在重新定时图上获得重新定时解决方案。 重新定时解决方案被归一化。 来自重新定时图的一个或多个重新定时延迟被传播到初始设计,并且通过使用约束满足分析来确认初始设计,以确定在满足一个或多个约束的情况下是否可以命中一个或多个目标。
    • 4. 发明申请
    • Using constraints in design verification
    • 在设计验证中使用约束
    • US20070074136A1
    • 2007-03-29
    • US11236451
    • 2005-09-27
    • Jason BaumgartnerHari MonyViresh ParuthiJiazhao Xu
    • Jason BaumgartnerHari MonyViresh ParuthiJiazhao Xu
    • G06F17/50
    • G06F17/504
    • A method for generating a constraint for use in the verification of an integrated circuit design includes identifying a target in a netlist (N) of the design and creating an overapproximate abstraction (N′) of the netlist. A space state (S′) is created by enumerating the states of N′ from which the identified target may be asserted. A constraint space C′ is then derived from the state space S′, where C′ is the logical complement of S′. The process is repeated for multiple selected targets and the constraint spaces from each iteration are logically ANDed. Creating an overapproximate abstraction may include replacing a sequential gate with a random gate. Identifying a sequential gate may include selecting a target in the netlist, performing underapproximate verification of the target, and, if a spurious failure occurs, selecting a gate further down the fanin chain of the currently selected gate.
    • 一种用于生成用于验证集成电路设计的约束的方法包括识别设计的网表(N)中的目标并创建网表的过近似抽象(N')。 通过枚举从其识别出的目标可以被断言的N'的状态来创建空间状​​态(S')。 然后从状态空间S'导出约束空间C',其中C'是S'的逻辑补码。 对于多个选定的目标重复该过程,并且来自每个迭代的约束空间被逻辑地进行AND。 创建过近似抽象可能包括用随机门替换顺序门。 识别顺序门可以包括选择网表中的目标,执行目标的近似不正确的验证,并且如果发生虚假故障,则选择进一步向下沿当前选择的门的扇形链的门。
    • 6. 发明授权
    • Using constraints in design verification
    • 在设计验证中使用约束
    • US07856609B2
    • 2010-12-21
    • US12164781
    • 2008-06-30
    • Jason R. BaumgartnerHari MonyViresh ParuthiJiazhao Xu
    • Jason R. BaumgartnerHari MonyViresh ParuthiJiazhao Xu
    • G06F9/45G06F17/50
    • G06F17/504
    • A method for generating a constraint for generating a constraint for use in the verification of an integrated circuit design includes identifying a target in a netlist (N) of the design and creating an overapproximate abstraction (N′) of the netlist. A space state (S′) is created by enumerating the states of N′ from which the identified target may be asserted. A constraint space C′ is then derived from the state space S′, where C′ is the logical complement of S′. The process is repeated for multiple selected targets and the constraint spaces from each iteration are logically ANDed. Creating an overapproximate abstraction may include replacing a sequential gate with a random gate. Identifying a sequential gate may include selecting a target in the netlist, performing underapproximate verification of the target, and, if a spurious failure occurs, selecting a gate further down the fanin chain of the currently selected gate.
    • 用于生成用于生成用于集成电路设计的验证的约束的约束的方法包括识别所述设计的网表(N)中的目标并且创建所述网表的过近似抽象(N')。 通过枚举从其识别出的目标可以被断言的N'的状态来创建空间状​​态(S')。 然后从状态空间S'导出约束空间C',其中C'是S'的逻辑补码。 对于多个选定的目标重复该过程,并且来自每个迭代的约束空间被逻辑地进行AND。 创建过近似抽象可能包括用随机门替换顺序门。 识别顺序门可以包括选择网表中的目标,执行目标的近似不正确的验证,并且如果发生虚假故障,则选择进一步向下沿当前选择的门的扇形链的门。
    • 7. 发明授权
    • Using constraints in design verification
    • 在设计验证中使用约束
    • US07421669B2
    • 2008-09-02
    • US11236451
    • 2005-09-27
    • Jason Raymond BaumgartnerHari MonyViresh ParuthiJiazhao Xu
    • Jason Raymond BaumgartnerHari MonyViresh ParuthiJiazhao Xu
    • G06F9/45G06F17/50
    • G06F17/504
    • A method for generating a constraint for use in the verification of an integrated circuit design includes identifying a target in a netlist (N) of the design and creating an overapproximate abstraction (N′) of the netlist. A space state (S′) is created by enumerating the states of N′ from which the identified target may be asserted. A constraint space C′ is then derived from the state space S′, where C′ is the logical complement of S′. The process is repeated for multiple selected targets and the constraint spaces from each iteration are logically ANDed. Creating an overapproximate abstraction may include replacing a sequential gate with a random gate. Identifying a sequential gate may include selecting a target in the netlist, performing underapproximate verification of the target, and, if a spurious failure occurs, selecting a gate further down the fanin chain of the currently selected gate.
    • 一种用于生成用于验证集成电路设计的约束的方法包括识别设计的网表(N)中的目标并创建网表的过近似抽象(N')。 通过枚举从其识别出的目标可以被断言的N'的状态来创建空间状​​态(S')。 然后从状态空间S'导出约束空间C',其中C'是S'的逻辑补码。 对于多个选定的目标重复该过程,并且来自每个迭代的约束空间被逻辑地进行AND。 创建过近似抽象可能包括用随机门替换顺序门。 识别顺序门可以包括选择网表中的目标,执行目标的近似不正确的验证,并且如果发生虚假故障,则选择进一步向下沿当前选择的门的扇形链的门。
    • 10. 发明申请
    • USING CONSTRAINTS IN DESIGN VERIFICATION
    • 在设计验证中使用约束
    • US20080256499A1
    • 2008-10-16
    • US12164781
    • 2008-06-30
    • Jason Raymond BaumgartnerHari MonyViresh ParuthiJiazhao Xu
    • Jason Raymond BaumgartnerHari MonyViresh ParuthiJiazhao Xu
    • G06F17/50
    • G06F17/504
    • A method for generating a constraint for generating a constraint for use in the verification of an integrated circuit design includes identifying a target in a netlist (N) of the design and creating an overapproximate abstraction (N′) of the netlist. A space state (S′) is created by enumerating the states of N′ from which the identified target may be asserted. A constraint space C′ is then derived from the state space S′, where C′ is the logical complement of S′. The process is repeated for multiple selected targets and the constraint spaces from each iteration are logically ANDed. Creating an overapproximate abstraction may include replacing a sequential gate with a random gate. Identifying a sequential gate may include selecting a target in the netlist, performing underapproximate verification of the target, and, if a spurious failure occurs, selecting a gate further down the fanin chain of the currently selected gate.
    • 用于生成用于生成用于集成电路设计的验证的约束的约束的方法包括识别所述设计的网表(N)中的目标并且创建所述网表的过近似抽象(N')。 通过枚举从其识别出的目标可以被断言的N'的状态来创建空间状​​态(S')。 然后从状态空间S'导出约束空间C',其中C'是S'的逻辑补码。 对于多个选定的目标重复该过程,并且来自每个迭代的约束空间被逻辑地进行AND。 创建过近似抽象可能包括用随机门替换顺序门。 识别顺序门可以包括选择网表中的目标,执行目标的近似不正确的验证,并且如果发生虚假故障,则选择进一步向下沿当前选择的门的扇形链的门。