Patents by Inventor Shady Copty
Shady Copty 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).
-
Patent number: 9348737Abstract: A method and apparatus for generating at least one data record in respect to a database query comprising a fetch command. A database may be updated according to the at least one data record. In an exemplary embodiment, a database management system may be tested by performing the database query against the database. In another exemplary embodiment, a data record that satisfies the database query is generated in order to increase coverage when testing a database management system.Type: GrantFiled: April 15, 2012Date of Patent: May 24, 2016Assignee: International Business Machines CorporationInventor: Shady Copty
-
Publication number: 20150007311Abstract: Machines, systems and methods for data security on a computing device are provided. In one embodiment, the method comprises a method for securing data stored on a data storage medium, the method comprising: activating a first module to remove a layer of security applied to target data stored on a data storage medium associated with a computing device, in response to detecting presence of a security key within a first range of the computing device, wherein the layer of security prevents access to the target data when the first module is inactive, and deactivating the first module, in response to detecting that the security key is no longer within the first range of the computing device, wherein the layer of security is applied to the target data when the first module is deactivated.Type: ApplicationFiled: July 1, 2013Publication date: January 1, 2015Inventor: Shady Copty
-
Patent number: 8892386Abstract: An apparatus and a computer-implemented method performed by a computerized device, comprising: generating a collection of test data for testing one or more domains, wherein the test data is useful for post-silicon verification of hardware devices; selecting a subset of the collection of test data in accordance with a hardware device to be tested and at least one of the domains to be tested with respect to the hardware device; and indexing the subset of the collection of test data to obtain an indexed collection.Type: GrantFiled: July 10, 2011Date of Patent: November 18, 2014Assignee: International Business Machines CorporationInventors: Allon Adir, Eyal Bin, Shady Copty, Anatoly Koyfman, Shimon Landa, Amir Nahir, Vitali Sokhin, Elena Tsanko
-
Patent number: 8868976Abstract: A system-level testcase may be generated by performing system-level generation tasks by a system-level generator to produce an abstract testcase. Based upon the abstract testcase, one or more unit-level generators may generate the testcase. The testcase may be utilized in simulation of operation of a system-under-test (SUT). The testcase may be utilized for verification of the SUT. The SUT may comprise a plurality of units. The unit-level generator may be associated with units of the SUT and perform generation tasks associated with pertinent units.Type: GrantFiled: November 4, 2010Date of Patent: October 21, 2014Assignee: International Business Machines CorporationInventors: Shimon Ben-Yehuda, Shady Copty, Alex Goryachev, John David Jabusch, Ronny Morad
-
Publication number: 20130013246Abstract: An apparatus and a computer-implemented method performed by a computerized device, comprising: generating a collection of test data for testing one or more domains, wherein the test data is useful for post-silicon verification of hardware devices; selecting a subset of the collection of test data in accordance with a hardware device to be tested and at least one of the domains to be tested with respect to the hardware device; and indexing the subset of the collection of test data to obtain an indexed collection.Type: ApplicationFiled: July 10, 2011Publication date: January 10, 2013Applicant: International Business Machines CorporationInventors: Allon Adir, Eyal Bin, Shady Copty, Anatoly Koyfman, Shimon Landa, Amir Nahir, Vitali Sokhin, Elena Tsanko
-
Publication number: 20120197867Abstract: A method and apparatus for generating at least one data record in respect to a database query comprising a fetch command. A database may be updated according to the at least one data record. In an exemplary embodiment, a database management system may be tested by performing the database query against the database. In another exemplary embodiment, a data record that satisfies the database query is generated in order to increase coverage when testing a database management system.Type: ApplicationFiled: April 15, 2012Publication date: August 2, 2012Applicant: International Business Machines CorporationInventor: Shady Copty
-
Patent number: 8200655Abstract: A method and apparatus for generating at least one data record in respect to a database query comprising a fetch command. A database may be updated according to the at least one data record. In an exemplary embodiment, a database management system may be tested by performing the database query against the database. In another exemplary embodiment, a data record that satisfies the database query is generated in order to increase coverage when testing a database management system.Type: GrantFiled: January 22, 2009Date of Patent: June 12, 2012Assignee: International Business Machines CorporationInventor: Shady Copty
-
Publication number: 20120117424Abstract: A system-level testcase may be generated by performing system-level generation tasks by a system-level generator to produce an abstract testcase. Based upon the abstract testcase, one or more unit-level generators may generate the testcase. The testcase may be utilized in simulation of operation of a system-under-test (SUT). The testcase may be utilized for verification of the SUT. The SUT may comprise a plurality of units. The unit-level generator may be associated with units of the SUT and perform generation tasks associated with pertinent units.Type: ApplicationFiled: November 4, 2010Publication date: May 10, 2012Inventors: Shimon Ben-Yehuda, Shady Copty, Alex Goryachev, John David Jabusch, Ronny Morad
-
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
-
Patent number: 8117499Abstract: A test template comprising a repetitive block instruction is translated to a stimuli to be used by a target computerized system or a simulator of such a system. The translation comprises reusing translated portion of the repetitive block instruction in order to reduce translation time and to hasten testing phase of the target computerized system. Reuse may be affected by subcomponents of the target computerized system, a predetermined minimal or maximal number of instructions to reuse, and a heuristic determination to increase possibility of discovering a bug using the stimuli.Type: GrantFiled: June 16, 2009Date of Patent: February 14, 2012Assignee: International Business Machines CorporationInventors: Shady Copty, Alex Goryachev
-
Publication number: 20100318850Abstract: A test template comprising a repetitive block instruction is translated to a stimuli to be used by a target computerized system or a simulator of such a system. The translation comprises reusing translated portion of the repetitive block instruction in order to reduce translation time and to hasten testing phase of the target computerized system. Reuse may be affected by subcomponents of the target computerized system, a predetermined minimal or maximal number of instructions to reuse, and a heuristic determination to increase possibility of discovering a bug using the stimuli.Type: ApplicationFiled: June 16, 2009Publication date: December 16, 2010Applicant: International Business Machines CorporationInventors: Shady Copty, Alex Goryachev
-
Publication number: 20100185694Abstract: A method and apparatus for generating at least one data record in respect to a database query comprising a fetch command. A database may be updated according to the at least one data record. In an exemplary embodiment, a database management system may be tested by performing the database query against the database. In another exemplary embodiment, a data record that satisfies the database query is generated in order to increase coverage when testing a database management system.Type: ApplicationFiled: January 22, 2009Publication date: July 22, 2010Inventor: Shady Copty
-
Patent number: 7752006Abstract: Some demonstrative embodiments of the invention may include, for example, devices, systems and methods of performing functional verification of a hardware design. In some demonstrative embodiments, a test generator may include a transaction generator to automatically generate a plurality of manipulated transactions by manipulating one or more test case transactions resulting from a constraint-satisfaction-problem.Type: GrantFiled: June 19, 2007Date of Patent: July 6, 2010Assignee: International Business Machines CorporationInventors: Shady Copty, Alex Goryachev
-
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: 20080319729Abstract: Some demonstrative embodiments of this invention may include, for example, devices, systems and methods of performing functional verification of a hardware design. In some demonstrative embodiments, a test generator may include a transaction generator to automatically generate a plurality of manipulated transactions by manipulating one or more test case transactions resulting from a constraint-satisfaction-problem. Other embodiments are described and claimed.Type: ApplicationFiled: June 19, 2007Publication date: December 25, 2008Inventors: Shady Copty, Alex Goryachev
-
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: 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
-
Publication number: 20080126070Abstract: Systems and methods for determining whether a first system model is consistent with a second system model in a verification system are provide. The method comprises generating a first constraint satisfaction problem (CSP) from a first system model; solving the first CSP to generate a first solution; generating a second CSP from a second system model; determining that the first and second system models are inconsistent, in response to the first solution failing to validate against the second CSP; solving the second CSP to generate a second solution; and determining that the first and second system models are inconsistent, in response to the second solution failing to validate against the first CSP.Type: ApplicationFiled: August 14, 2006Publication date: May 29, 2008Inventors: Shady Copty, Felix Geller
-
Publication number: 20070271207Abstract: 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: May 18, 2006Publication date: November 22, 2007Inventors: Shady Copty, Roy Emek, Itai Jaeger, Yoav Katz, Shai Lubliner