公开(公告)号：US20130080363A9

公开(公告)日：2013-03-28

申请号：US12477145

申请日：2009-06-03

申请人： Roy Emek ,  Itai Jaeger ,  Yehuda Naveh

发明人： Roy Emek ,  Itai Jaeger ,  Yehuda Naveh

IPC分类号： G06N5/02

CPC分类号： 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; 以及响应于确定对变量的至少一个分配值与约束相矛盾而产生结果。

公开(公告)号：US20100312738A1

公开(公告)日：2010-12-09

申请号：US12477145

申请日：2009-06-03

申请人： Roy Emek ,  Itai Jaeger ,  Yehuda Naveh

发明人： Roy Emek ,  Itai Jaeger ,  Yehuda Naveh

IPC分类号： G06N5/02

CPC分类号： 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; 以及响应于确定对变量的至少一个分配值与约束相矛盾而产生结果。

公开(公告)号：US20070255667A1

公开(公告)日：2007-11-01

申请号：US11380955

申请日：2006-05-01

申请人： Roy Emek ,  Itai Jaeger ,  Yehuda Naveh

发明人： Roy Emek ,  Itai Jaeger ,  Yehuda Naveh

IPC分类号： G06F15/18 ,  G06E1/00

CPC分类号： 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; 以及响应于确定对变量的至少一个分配值与约束相矛盾而产生结果。

公开(公告)号：US08433668B2

公开(公告)日：2013-04-30

申请号：US12477145

申请日：2009-06-03

申请人： Roy Emek ,  Itai Jaeger ,  Yehuda Naveh

发明人： Roy Emek ,  Itai Jaeger ,  Yehuda Naveh

IPC分类号： G06F17/00 ,  G06N5/02

CPC分类号： 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.

公开(公告)号：US07562061B2

公开(公告)日：2009-07-14

申请号：US11380955

申请日：2006-05-01

申请人： Roy Emek ,  Itai Jaeger ,  Yehuda Naveh

发明人： Roy Emek ,  Itai Jaeger ,  Yehuda Naveh

IPC分类号： G06N5/02

CPC分类号： 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; 以及响应于确定对变量的至少一个分配值与约束相矛盾而产生结果。

公开(公告)号：US20070011631A1

公开(公告)日：2007-01-11

申请号：US11177127

申请日：2005-07-07

申请人： Shai Fine ,  Ari Freund ,  Itai Jaeger ,  Yehuda Naveh ,  Avi Ziv

发明人： Shai Fine ,  Ari Freund ,  Itai Jaeger ,  Yehuda Naveh ,  Avi Ziv

IPC分类号： G06F17/50

CPC分类号： G01R31/318357

摘要： Test generation is improved by learning the relationship between an initial state vector for a stimuli generator and generation success. A stimuli generator for a design-under-verification is provided with information about the success probabilities of potential assignments to an initial state bit vector. Selection of initial states according to the success probabilities ensures a higher success rate than would be achieved without this knowledge. The approach for obtaining an initial state bit vector employs a CSP solver. A learning system is directed to model the behavior of possible initial state assignments. The learning system develops the structure and parameters of a Bayesian network that describes the relation between the initial state and generation success.

摘要翻译： 通过学习刺激发生器的初始状态向量与生成成功之间的关系来提高测试生成。 提供了一种用于未验证设计的刺激发生器，其中提供了关于初始状态位向量的潜在分配的成功概率的信息。 根据成功概率选择初始状态确保比没有这种知识将获得的成功率更高的成功率。 用于获得初始状态位向量的方法采用CSP求解器。 学习系统旨在模拟可能的初始状态分配的行为。 学习系统开发了贝叶斯网络的结构和参数，描述了初始状态与发电成功之间的关系。

公开(公告)号：US07007207B2

公开(公告)日：2006-02-28

申请号：US10277520

申请日：2002-10-21

申请人： Roy Emek ,  Yehuda Naveh

发明人： Roy Emek ,  Yehuda Naveh

IPC分类号： G06F11/00

CPC分类号： G06F11/263 ,  G06F17/5022 ,  G06F2217/68

摘要： A test-program generator capable of implementing a methodology, based on a formal language, for scheduling system-level transactions in generated test programs. A system to be tested may be composed of multiple processors, busses, bus-bridges, shared memories, etc. The scheduling methodology is based on an exploration of scheduling abilities in a hardware system and features a Hierarchical Scheduling Language for specifying transactions and their ordering. Through a grouping hierarchy, which may also be expressed in the form of an equivalent tree, the Hierarchical Scheduling Language combines the ability to stress related logical areas of the system with the possibility of applying high-level scheduling requests. A method for generating testcases based on request-files written in the Hierarchical Scheduling Language is also presented.

摘要翻译： 一种测试程序生成器，能够实现基于形式语言的方法，用于调度生成的测试程序中的系统级事务。 要测试的系统可以由多个处理器，总线，总线桥，共享存储器等组成。调度方法基于对硬件系统中的调度能力的探索，并且具有用于指定事务及其排序的分层调度语言 。 通过也可以以等效树的形式表示的分组层级，分层调度语言将将系统的相关逻辑区域与应用高级调度请求的可能性相结合的能力。 还提出了一种基于以分层调度语言编写的请求文件生成测试用例的方法。

公开(公告)号：US07331007B2

公开(公告)日：2008-02-12

申请号：US11177127

申请日：2005-07-07

申请人： Shai Fine ,  Ari Freund ,  Itai Jaeger ,  Yehuda Naveh ,  Avi Ziv

发明人： Shai Fine ,  Ari Freund ,  Itai Jaeger ,  Yehuda Naveh ,  Avi Ziv

IPC分类号： G06F11/00 ,  G06F17/50

CPC分类号： G01R31/318357

摘要： Test generation is improved by learning the relationship between an initial state vector for a stimuli generator and generation success. A stimuli generator for a design-under-verification is provided with information about the success probabilities of potential assignments to an initial state bit vector. Selection of initial states according to the success probabilities ensures a higher success rate than would be achieved without this knowledge. The approach for obtaining an initial state bit vector employs a CSP solver. A learning system is directed to model the behavior of possible initial state assignments. The learning system develops the structure and parameters of a Bayesian network that describes the relation between the initial state and generation success.

摘要翻译： 通过学习刺激发生器的初始状态向量与生成成功之间的关系来提高测试生成。 提供了一种用于未验证设计的刺激发生器，其中提供了关于初始状态位向量的潜在分配的成功概率的信息。 根据成功概率选择初始状态确保比没有这种知识将获得的成功率更高的成功率。 用于获得初始状态位向量的方法采用CSP求解器。 学习系统旨在模拟可能的初始状态分配的行为。 学习系统开发了贝叶斯网络的结构和参数，描述了初始状态与发电成功之间的关系。

公开(公告)号：US20120209648A1

公开(公告)日：2012-08-16

申请号：US13455140

申请日：2012-04-25

申请人： Yehuda Naveh ,  Yossi Richter

发明人： Yehuda Naveh ,  Yossi Richter

IPC分类号： G06Q10/06

CPC分类号： G06Q10/06 ,  G06Q10/06312

摘要： A method for resource management includes associating respective variables with resource consumers, and identifying resources as values applicable to the variables. A group of the variables are identified as preferred variables. An assignment of the values to the variables that satisfies constraints applying to the allocation of the resources is found by repeatedly performing the steps of choosing a variable from the group, instantiating the chosen variable with a value, removing the chosen variable from the group, and pruning the domains of the other variables by propagation of the constraints. The resources are assigned to the resource consumers responsively to the assignment of the values to the variables.

摘要翻译： 一种用于资源管理的方法包括将相应的变量与资源使用者相关联，并将资源识别为适用于变量的值。 一组变量被确定为首选变量。 通过重复执行从组中选择变量的步骤，使用值实例化所选择的变量，从组中移除所选择的变量，找到对赋值应用于资源分配的变量的值的赋值，以及 通过约束的传播来修剪其他变量的域。 响应于将值分配给变量，将资源分配给资源消耗者。

公开(公告)号：US20110224817A1

公开(公告)日：2011-09-15

申请号：US12720693

申请日：2010-03-10

申请人： Bella Dubrov ,  Yehuda Naveh ,  Shlomo Hoory ,  Alfons Steinhoff ,  Ute Twisselmann

发明人： Bella Dubrov ,  Yehuda Naveh ,  Shlomo Hoory ,  Alfons Steinhoff ,  Ute Twisselmann

IPC分类号： G06F17/50 ,  G06F17/11

CPC分类号： G06F17/5095 ,  G06F2217/06 ,  G06Q10/04 ,  G06Q10/06

摘要： A truck configuration satisfying a truck configuration problem is automatically determined. The truck configuration problem is transformed to a target function, outputting values indicative of configurations satisfying the truck configuration problem. Stochastic local search methods are applied on the target function to determine the truck configuration. Preprocessing may be performed to improve efficiency, performance or the like of the stochastic local search methods. The truck configuration problem may be obtained from several sources, which may be independent of one another.

摘要翻译： 自动确定满足卡车配置问题的卡车配置。 卡车配置问题被转换为目标功能，输出表示满足卡车配置问题的配置的值。 目标函数应用随机局部搜索方法来确定卡车配置。 可以执行预处理以提高随机局部搜索方法的效率，性能等。 卡车配置问题可以从多个来源获得，其可以彼此独立。