Patents by Inventor Itai Jaeger
Itai Jaeger has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20130196305Abstract: A computer-implemented method and apparatus for generating questions. The method comprises receiving a rule; dynamically generating a graph representing a question, the graph comprising one or more nodes, each node associated with a rule having one or more variables; sampling a value from the value domain for the variable; and synthesizing a textual representation of the graph.Type: ApplicationFiled: January 30, 2012Publication date: August 1, 2013Applicant: International Business Machines CorporationInventors: Allon Adir, Itai Jaeger, Ronen Levy, Tamer Salman
-
Patent number: 8433668Abstract: 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.Type: GrantFiled: June 3, 2009Date of Patent: April 30, 2013Assignee: Internatinal Business Machines CorporationInventors: Roy Emek, Itai Jaeger, Yehuda Naveh
-
Publication number: 20130080363Abstract: 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.Type: ApplicationFiled: June 3, 2009Publication date: March 28, 2013Inventors: Roy Emek, Itai Jaeger, Yehuda Naveh
-
Patent number: 8280713Abstract: A parametrically controlled model-based test generator automatically generates architectural compliance test suites for different implementations of a processor architecture, based on a set of architectural decisions chosen among optional behaviors for each implementation. Thus, different implementations of the same architecture can be easily supported by modifying the parameter values. In addition, ongoing changes to the architecture or comprehensive updates to the test suite can be easily handled by updating the architecture model or the coverage models, forgoing the need to review the whole, potentially huge, set of tests.Type: GrantFiled: April 16, 2007Date of Patent: October 2, 2012Assignee: International Business Machines CorporationInventors: Allon Adir, Sigal Asaf, Laurent Fournier, Itai Jaeger
-
Patent number: 8161440Abstract: A computer software product is provided.Type: GrantFiled: June 15, 2008Date of Patent: April 17, 2012Assignee: International Business Machines CorporationInventors: Roy Emek, Itai Jaeger, Tzach Schechner
-
Patent number: 8140457Abstract: Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.Type: GrantFiled: July 9, 2008Date of Patent: March 20, 2012Assignee: International Business Machines CorporationInventors: Shady Copty, Roy Emek, Itai Jaeger, Yoav Katz, Shai Lubliner
-
Publication number: 20100312738Abstract: 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.Type: ApplicationFiled: June 3, 2009Publication date: December 9, 2010Inventors: Roy Emek, Itai Jaeger, Yehuda Naveh
-
Patent number: 7788610Abstract: 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.Type: GrantFiled: January 23, 2007Date of Patent: August 31, 2010Assignee: International Business Machines CorporationInventors: Roy Emek, Itai Jaeger, Yoav Avraham Katz
-
Patent number: 7673261Abstract: Methods and systems are presented for generation of a test suite in order to validate compliance of a process with its process specification. The methodology involves a formal description of the process using a flowchart, refinement of the flowchart to include misinterpretations of the process specification, defining compliance coverage models over the flowchart, and automatically generating test case scenarios that cover the models. Internal and external types of misinterpretation are distinguished. A compliance test suite is automatically generated and observations made of the details of the traversal through the flow chart when the tests are executed.Type: GrantFiled: February 7, 2007Date of Patent: March 2, 2010Assignee: International Business Machines CorporationInventors: Alion Adir, Sigal Asaf, Laurent Fournier, Itai Jaeger, Ofer Peled
-
Publication number: 20100010950Abstract: Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.Type: ApplicationFiled: July 9, 2008Publication date: January 14, 2010Inventors: SHADY COPTY, ROY EMEK, ITAI JAEGER, YOAV KATZ, SHAI LUBLINER
-
Publication number: 20090313590Abstract: A computer software product is provided.Type: ApplicationFiled: June 15, 2008Publication date: December 17, 2009Inventors: Roy Emek, Itai Jaeger, Tzach Schechner
-
Patent number: 7627843Abstract: The input for a test generator is a plurality of test templates, each of which typically aims at covering a specific verification task. Test templates direct the production of distinct transactions, which are the atomic functional building blocks of the design-under-verification. Test templates directed to different hardware functions of the scenario are dynamically interleaved. In this way several transactions are combined together in complex statements in order to achieve a complex test scenario. The transactions are submitted to the test generator, which generates test cases, in which the different hardware functions of the scenario are exercised in combinations. Variation among the test cases is achieved through a large number of random decisions made during the generation process.Type: GrantFiled: March 23, 2005Date of Patent: December 1, 2009Assignee: International Business Machines CorporationInventors: Igor Dozorets, Roy Emek, Sanjay Gupta, Itai Jaeger, Lawrence Allyn McConville, Tzach Schechner, Todd Swanson
-
Patent number: 7562061Abstract: 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.Type: GrantFiled: May 1, 2006Date of Patent: July 14, 2009Assignee: International Business Machines CorporationInventors: Roy Emek, Itai Jaeger, Yehuda Naveh
-
Publication number: 20080255822Abstract: A parametrically controlled model-based test generator automatically generates architectural compliance test suites for different implementations of a processor architecture, based on a set of architectural decisions chosen among optional behaviors for each implementation. Thus, different implementations of the same architecture can be easily supported by modifying the parameter values. In addition, ongoing changes to the architecture or comprehensive updates to the test suite can be easily handled by updating the architecture model or the coverage models, forgoing the need to review the whole, potentially huge, set of tests.Type: ApplicationFiled: April 16, 2007Publication date: October 16, 2008Inventors: Allon Adir, Sigal Asaf, Laurent Fournier, Itai Jaeger
-
Patent number: 7434101Abstract: Improvements in functional verification of a design are achieved by providing a test template that specifies test parameters directed to a function of the design. An exemption mode of operation is associated with a portion of the template, in which constraints and variables associated with the template are revised. The template is an input to a CSP engine, which, in cooperation with a test generator engine, produces test scenarios that lie in an expanded region of the generator's usual operational space. Provision is made for independently enabling and disabling a plurality of exemption modes of operation that are associated with the same or different areas of the template.Type: GrantFiled: March 21, 2005Date of Patent: October 7, 2008Assignee: International Business Machines CorporationInventors: Allon Adir, Roy Emek, Itai Jaeger, Eitan Marcus, Tzach Schechner
-
Patent number: 7415444Abstract: Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.Type: GrantFiled: May 18, 2006Date of Patent: August 19, 2008Assignee: International Business Machines CorporationInventors: Shady Copty, Roy Emek, Itai Jaeger, Yoav Katz, Shai Lubliner
-
Publication number: 20080189094Abstract: Methods and systems are presented for generation of a test suite in order to validate compliance of a process with its process specification. The methodology involves a formal description of the process using a flowchart, refinement of the flowchart to include misinterpretations of the process specification, defining compliance coverage models over the flowchart, and automatically generating test case scenarios that cover the models. Internal and external types of misinterpretation are distinguished. A compliance test suite is automatically generated and observations made of the details of the traversal through the flow chart when the tests are executed.Type: ApplicationFiled: February 7, 2007Publication date: August 7, 2008Inventors: Allon Adir, Sigal Asaf, Laurent Fournier, Itai Jaeger, Ofer Peled
-
Publication number: 20080189230Abstract: Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.Type: ApplicationFiled: April 3, 2008Publication date: August 7, 2008Applicant: International Business Machines CorporationInventors: Shady Copty, Roy Emek, Itai Jaeger, Yoav Katz, Shai Lubliner
-
Patent number: 7409377Abstract: Methods, systems and apparatus for modeling a target system includes defining a constraint satisfaction problem (CSP) that characterizes the target system in terms of a set of variables, each having a respective input domain, and initial constraints applicable to the variables. The variables are partitioned into at least first and second sets. An abstract solution is found to the CSP, including a given assignment of the variables in the first set. A reduced domain of at least one of the variables in the second set is computed, so as to be compatible with the abstract solution. A redundant constraint on the abstract solution is determined responsively to the reduced domain. A concrete solution to the CSP is then found, using the abstract solution and the redundant constraint.Type: GrantFiled: March 29, 2005Date of Patent: August 5, 2008Assignee: International Business Machines CorporationInventors: Roy Emek, Itai Jaeger
-
Publication number: 20080177968Abstract: 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.Type: ApplicationFiled: January 23, 2007Publication date: July 24, 2008Inventors: Roy Emek, Itai Jaeger, Yoav Avraham Katz