会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Highly specialized scenarios in random test generation
    • 随机测试生成中的高度专业化场景
    • US08161440B2
    • 2012-04-17
    • US12139476
    • 2008-06-15
    • Roy EmekItai JaegerTzach Schechner
    • Roy EmekItai JaegerTzach Schechner
    • G06F17/50
    • G01R31/318385G06F17/5022
    • A computer software product is provided. The product includes a computer-readable medium in which computer program instructions are stored, which instructions, when read by a computer, cause the computer to perform a method for functional verification of a design, having an operational space comprising the steps of accepting as an input a test template that specifies test parameters directed to a function of the design, the template comprising constraints and variables covering a working space within the operational space, associating an exemption mode of operation with at least one of the constraints or at least one of the variables, wherein a domain of the at least one of the variables is modified or the at least one of the constraints is disabled in the exemption mode of operation, producing a test case that lies in the operational space of the design by enabling the exemption mode of operation, the test case comprising a series of transactions originating from the template, wherein the transactions exercise the function of the design, wherein the working space is modified in the exemption mode of operation and submitting the test case for execution by the design, wherein the exemption mode of operation is associated with only a portion of the template.
    • 提供计算机软件产品。 该产品包括其中存储有计算机程序指令的计算机可读介质,当由计算机读取时,哪些指令使计算机执行用于功能验证设计的方法,具有操作空间,其包括以下步骤: 输入测试模板,其指定针对设计功能的测试参数,所述模板包括约束和覆盖所述操作空间内的工作空间的变量,将所述操作的豁免模式与所述约束中的至少一个相关联, 变量,其中所述变量中的所述至少一个变量的域被修改或所述约束中的所述至少一个在所述豁免操作模式中被禁用,通过启用所述豁免模式产生位于所述设计的操作空间中的测试用例 所述测试用例包括源自所述模板的一系列交易,其中所述交易行使所述功能 在设计中,其中工作空间在豁免操作模式下被修改并且通过设计提交测试用例来执行,其中所述豁免操作模式仅与所述模板的一部分相关联。
    • 6. 发明申请
    • HIGHLY SPECIALIZED SCENARIOS IN RANDOM TEST GENERATION
    • 随机测试生成中的高度专业化风景
    • US20090313590A1
    • 2009-12-17
    • US12139476
    • 2008-06-15
    • Roy EmekItai JaegerTzach Schechner
    • Roy EmekItai JaegerTzach Schechner
    • G06F17/50
    • G01R31/318385G06F17/5022
    • A computer software product is provided. The product includes a computer-readable medium in which computer program instructions are stored, which instructions, when read by a computer, cause the computer to perform a method for functional verification of a design, having an operational space comprising the steps of accepting as an input a test template that specifies test parameters directed to a function of the design, the template comprising constraints and variables covering a working space within the operational space, associating an exemption mode of operation with at least one of the constraints or at least one of the variables, wherein a domain of the at least one of the variables is modified or the at least one of the constraints is disabled in the exemption mode of operation, producing a test case that lies in the operational space of the design by enabling the exemption mode of operation, the test case comprising a series of transactions originating from the template, wherein the transactions exercise the function of the design, wherein the working space is modified in the exemption mode of operation and submitting the test case for execution by the design, wherein the exemption mode of operation is associated with only a portion of the template.
    • 提供计算机软件产品。 该产品包括其中存储有计算机程序指令的计算机可读介质,当由计算机读取时,哪些指令使计算机执行用于功能验证设计的方法,具有操作空间,其包括以下步骤: 输入测试模板,其指定针对设计功能的测试参数,所述模板包括约束和覆盖所述操作空间内的工作空间的变量,将所述操作的豁免模式与所述约束中的至少一个相关联, 变量,其中所述变量中的所述至少一个变量的域被修改或所述约束中的所述至少一个在所述豁免操作模式中被禁用,通过启用所述豁免模式产生位于所述设计的操作空间中的测试用例 所述测试用例包括源自所述模板的一系列交易,其中所述交易行使所述功能 在设计中,其中工作空间在豁免操作模式下被修改并且通过设计提交测试用例来执行,其中所述豁免操作模式仅与所述模板的一部分相关联。
    • 8. 发明申请
    • CONTEXT-BASED FAILURE REPORTING FOR A CONSTRAINT SATISFACTION PROBLEM
    • 基于上下文的失败报告的约束满意度问题
    • US20100312738A1
    • 2010-12-09
    • US12477145
    • 2009-06-03
    • Roy EmekItai JaegerYehuda Naveh
    • Roy EmekItai JaegerYehuda Naveh
    • G06N5/02
    • G06N5/045
    • A method for solving a constraint satisfaction problem (CSP) comprises identifying a first illegal combination associated with at least one variable, wherein the first illegal combination contradicts at least one constraint; grouping the first illegal combination with a second illegal combination, in response to determining that the first and second illegal combinations contradict the same constraint; identifying at least one failure explanation for each group of illegal combinations, wherein the failure explanation is associated with at least one illegal combination in said group to provide a reason for a contradicted constraint associated with the illegal combination; assigning a value to each variable in the given domain to solve the CSP within the limitations defined by the constraints in a solution path; and generating a result, in response to determining that at least one assigned value to a variable contradicts a constraint.
    • 一种用于解决约束满足问题(CSP)的方法包括:识别与至少一个变量相关联的第一非法组合,其中所述第一非法组合与至少一个约束相矛盾; 响应于确定第一和第二非法组合与相同的约束相矛盾,将第一非法组合与第二非法组合分组; 识别每组非法组合的至少一个故障解释,其中所述故障解释与所述组中的至少一个非法组合相关联,以提供与所述非法组合相关联的矛盾约束的原因; 为给定域中的每个变量分配一个值,以在由解决路径中的约束定义的限制内解决CSP; 以及响应于确定对变量的至少一个分配值与约束相矛盾而产生结果。
    • 9. 发明申请
    • Context-Based Failure Reporting For A Constraint Satisfaction Problem
    • 基于上下文的失败报告用于约束满足问题
    • US20070255667A1
    • 2007-11-01
    • US11380955
    • 2006-05-01
    • Roy EmekItai JaegerYehuda Naveh
    • Roy EmekItai JaegerYehuda Naveh
    • G06F15/18G06E1/00
    • G06N5/045
    • A method for solving a constraint satisfaction problem (CSP) comprises identifying a first illegal combination associated with at least one variable, wherein the first illegal combination contradicts at least one constraint; grouping the first illegal combination with a second illegal combination, in response to determining that the first and second illegal combinations contradict the same constraint; identifying at least one failure explanation for each group of illegal combinations, wherein the failure explanation is associated with at least one illegal combination in said group to provide a reason for a contradicted constraint associated with the illegal combination; assigning a value to each variable in the given domain to solve the CSP within the limitations defined by the constraints in a solution path; and generating a result, in response to determining that at least one assigned value to a variable contradicts a constraint.
    • 一种用于解决约束满足问题(CSP)的方法包括:识别与至少一个变量相关联的第一非法组合,其中所述第一非法组合与至少一个约束相矛盾; 响应于确定第一和第二非法组合与相同的约束相矛盾,将第一非法组合与第二非法组合分组; 识别每组非法组合的至少一个故障解释,其中所述故障解释与所述组中的至少一个非法组合相关联,以提供与所述非法组合相关联的矛盾约束的原因; 为给定域中的每个变量分配一个值,以在由解决路径中的约束定义的限制内解决CSP; 以及响应于确定对变量的至少一个分配值与约束相矛盾而产生结果。
    • 10. 发明授权
    • Random stimuli generation of memory maps and memory allocations
    • 随机刺激生成内存映射和内存分配
    • US07788610B2
    • 2010-08-31
    • US11625831
    • 2007-01-23
    • Roy EmekItai JaegerYoav Avraham Katz
    • Roy EmekItai JaegerYoav Avraham Katz
    • G06F17/50
    • G06F17/5022
    • A computer-implemented method for verification of a hardware design includes specifying requests to allocate regions in a memory of the hardware design, such that at least two of the requests are specified independently of one another. The requests indicate respective allocation types.Overlap restrictions are specified between at least some of the allocation types. The requests and the overlap restrictions are automatically converted to a constraint satisfaction problem (CSP), which includes CSP constraints based on the requests, the allocation types and the overlap restrictions.The CSP is solved to produce a random test program, which includes a memory map that allocates the regions in the memory while complying with the requests and the overlap restrictions. The test program is applied to the hardware design.
    • 用于验证硬件设计的计算机实现的方法包括指定在硬件设计的存储器中分配区域的请求,使得至少两个请求彼此独立地指定。 请求指示相应的分配类型。 在至少一些分配类型之间指定重叠限制。 请求和重叠限制自动转换为约束满足问题(CSP),其包括基于请求的CSP约束,分配类型和重叠限制。 CSP被解决以产生随机测试程序,其包括在遵守请求和重叠限制的情况下在存储器中分配区域的存储器映射。 测试程序适用于硬件设计。