Patents by Inventor Tatyana Veksler
Tatyana Veksler 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: 10503633Abstract: Method, apparatus and product for symbolic execution of alternative branches. The method comprising reaching, during symbolic execution of a Control Flow Graph (CFG) of a program, a branching node in the CFG with a first symbolic state, wherein the branching has at least a first branch and a second branch, wherein the first and second branches end at a joining node in the CFG. The method further comprises symbolically executing the first branch using the first symbolic state so as to determine a second symbolic state. The method further comprises symbolically executing the second branch using the second symbolic state so as to determine a third symbolic state. Accordingly, the third symbolic state is based on sequential symbolic execution of alternative branches.Type: GrantFiled: March 30, 2016Date of Patent: December 10, 2019Assignee: International Business Machines CorporationInventors: Dmitry Pidan, Tatyana Veksler
-
Publication number: 20170286271Abstract: Method, apparatus and product for symbolic execution of alternative branches. The method comprising reaching, during symbolic execution of a Control Flow Graph (CFG) of a program, a branching node in the CFG with a first symbolic state, wherein the branching has at least a first branch and a second branch, wherein the first and second branches end at a joining node in the CFG. The method further comprises symbolically executing the first branch using the first symbolic state so as to determine a second symbolic state. The method further comprises symbolically executing the second branch using the second symbolic state so as to determine a third symbolic state.Type: ApplicationFiled: March 30, 2016Publication date: October 5, 2017Inventors: Dmitry Pidan, Tatyana Veksler
-
Patent number: 8656341Abstract: Obtaining a functional coverage model of a System Under Test (SUT) defining all functional coverage tasks of the SUT, wherein the functional coverage model defining a test-space with respect to functional attributes; obtaining a set of covered functional coverage tasks; encoding a covered Binary Decision Diagram (BDD) to represent the set of covered functional coverage tasks within the test-space; and manipulating the covered BDD to identify one or more coverage holes, wherein a coverage hole defines a set of coverage tasks in the test-space, all having a same combination of values to a subset of the functional attributes, that are not covered by the set of covered functional coverage task.Type: GrantFiled: January 30, 2012Date of Patent: February 18, 2014Assignee: International Business Machines CorporationInventors: Rachel Tzoref-Brill, Itai Segall, Tatyana Veksler
-
Patent number: 8595676Abstract: A computer-implemented method, apparatus, and computer program product for assisting in dynamic verification of a System Under Test (SUT). The method comprising obtaining a set of functional attributes and associated domains with respect to a System Under Test (SUT), and obtaining a set of restrictions over the functional attributes and associated domains. The method comprising encoding a Binary Decision Diagram (BDD) to represent a Cartesian cross-product test-space of all possible combinations of values of the functional attributes excluding combinations that are restricted by the set of restrictions, whereby the BDD symbolically represents the Cartesian cross-product test-space. The method may further comprise analyzing the Cartesian cross-product test-space by manipulating the BDD so as to assist in performing dynamic verification of the SUT.Type: GrantFiled: June 19, 2011Date of Patent: November 26, 2013Assignee: International Business Machine CorporationInventors: Rachel Tzoref-Brill, Itai Segall, Tatyana Veksler
-
Publication number: 20130103983Abstract: Obtaining a functional coverage model of a System Under Test (SUT) defining all functional coverage tasks of the SUT, wherein the functional coverage model defining a test-space with respect to functional attributes; obtaining a set of covered functional coverage tasks; encoding a covered Binary Decision Diagram (BDD) to represent the set of covered functional coverage tasks within the test-space; and manipulating the covered BDD to identify one or more coverage holes, wherein a coverage hole defines a set of coverage tasks in the test-space, all having a same combination of values to a subset of the functional attributes, that are not covered by the set of covered functional coverage task.Type: ApplicationFiled: January 30, 2012Publication date: April 25, 2013Applicant: International Business Machines CorporationInventors: Rachel Tzoref-Brill, Itai Segall, Tatyana Veksler
-
Patent number: 8397192Abstract: An UNSAT core may be reused during iterations of a bounded model checking process. When increasing the bound, signals corresponding to signals within the UNSAT core may be used to represent the functionality of the model during cycles between the original bound and the increased bound. In case, consecutive unsatisfiability is determined in respect to different bounds, the same UNSAT core may be reused instead of computing a new UNSAT core.Type: GrantFiled: April 15, 2012Date of Patent: March 12, 2013Assignee: International Business Machines CorporationInventors: Oded Fuhrmann, Alexander Ivrii, Tatyana Veksler
-
Patent number: 8352234Abstract: A computerized system comprising: a processor; a first interface configured to obtain a constraint; a second interface configured to obtain a first model, wherein the first model is configured to be utilized in model checking, and the first model, when constrained by the constraint, comprises at least one finite path; and a finite path removal module implemented in the processor and configured to generate a second model equivalent to the first model obtained by said second interface, wherein the second model excludes a portion of the at least one finite path, and the second model is configured to be utilized in model checking.Type: GrantFiled: September 23, 2009Date of Patent: January 8, 2013Assignee: International Business Machines CorporationInventors: Sharon Keidar Barner, Shiri Moran, Ziv Nevo, Sitvanit Ruah, Tatyana Veksler
-
Publication number: 20120324414Abstract: A computer-implemented method, apparatus, and computer program product for assisting in dynamic verification of a System Under Test (SUT). The method comprising obtaining a set of functional attributes and associated domains with respect to a System Under Test (SUT), and obtaining a set of restrictions over the functional attributes and associated domains. The method comprising encoding a Binary Decision Diagram (BDD) to represent a Cartesian cross-product test-space of all possible combinations of values of the functional attributes excluding combinations that are restricted by the set of restrictions, whereby the BDD symbolically represents the Cartesian cross-product test-space. The method may further comprise analyzing the Cartesian cross-product test-space by manipulating the BDD so as to assist in performing dynamic verification of the SUT.Type: ApplicationFiled: June 19, 2011Publication date: December 20, 2012Applicant: International Business Machines CorporationInventors: Rachel Tzoref-Brill, Itai Segall, Tatyana Veksler
-
Publication number: 20120198400Abstract: An UNSAT core may be reused during iterations of a bounded model checking process. When increasing the bound, signals corresponding to signals within the UNSAT core may be used to represent the functionality of the model during cycles between the original bound and the increased bound. In case, consecutive unsatisfiability is determined in respect to different bounds, the same UNSAT core may be reused instead of computing a new UNSAT core.Type: ApplicationFiled: April 15, 2012Publication date: August 2, 2012Applicant: International Business Machines CorporationInventors: Oded Fuhrmann, Alexander Ivrii, Tatyana Veksler
-
Patent number: 8201116Abstract: An UNSAT core may be reused during iterations of a bounded model checking process. When increasing the bound, signals corresponding to signals within the UNSAT core may be used to represent the functionality of the model during cycles between the original bound and the increased bound. In case, consecutive unsatisfiability is determined in respect to different bounds, the same UNSAT core may be reused instead of computing a new UNSAT core.Type: GrantFiled: August 17, 2010Date of Patent: June 12, 2012Assignee: International Business Machines CorporationInventors: Oded Fuhrmann, Alexander Ivrii, Tatyana Veksler
-
Publication number: 20120046918Abstract: An UNSAT core may be reused during iterations of a bounded model checking process. When increasing the bound, signals corresponding to signals within the UNSAT core may be used to represent the functionality of the model during cycles between the original bound and the increased bound. In case, consecutive unsatisfiability is determined in respect to different bounds, the same UNSAT core may be reused instead of computing a new UNSAT core.Type: ApplicationFiled: August 17, 2010Publication date: February 23, 2012Inventors: Oded Fuhrmann, Alexander Ivrii, Tatyana Veksler
-
Publication number: 20110071809Abstract: A model may comprise finite paths in respect to a constraint. The model and the constraint may be modified such that a portion of the limitations induces by the constraint is injected to the model. Adding the limitation directly to the model may be expressed by a reduction of a measurement of nondeterminism in the model. The model may be modified based on the constraint, and the constraint may be modified based on the model. The constraint may be strengthened to provide for an early finite path detection.Type: ApplicationFiled: September 23, 2009Publication date: March 24, 2011Applicant: International Business Machines CorporationInventors: Sharon Keidar-Barner, Shiri Moran, Ziv Nevo, Sitvanit Ruah, Tatyana Veksler
-
Patent number: 7725851Abstract: Device, system and method of efficient automata-based implementation of liveness properties for formal verification. A system according to embodiments of the invention includes a property transformation module to receive an assume verification directive on a liveness property in a property specification language, and to translate the property a fairness statement that uses a deterministic automaton. The deterministic automaton is exponential in the size of the input property. The assume verification directive may be transformed into a strong suffix implication in the property specification language.Type: GrantFiled: August 27, 2007Date of Patent: May 25, 2010Assignee: International Business Machines CorporationInventors: Cynthia Rae Eisner, Sharon Keidar-Barner, Sitvanit Ruah, Ohad Shacham, Tatyana Veksler
-
Publication number: 20090064064Abstract: Device, system and method of efficient automata-based implementation of liveness properties for formal verification. A system according to embodiments of the invention includes a property transformation module to receive an assume verification directive on a liveness property in a property specification language, and to translate the property a fairness statement that uses a deterministic automaton. The deterministic automaton is exponential in the size of the input property. The assume verification directive may be transformed into a strong suffix implication in the property specification language.Type: ApplicationFiled: August 27, 2007Publication date: March 5, 2009Inventors: Cynthia Rae Eisner, Sharon Keidar-Barner, Sitvanit Ruah, Ohad Shacham, Tatyana Veksler
-
Publication number: 20090024557Abstract: A computer-implemented method for verification of a target system includes defining a formula describing the target system, the formula including clauses, which include variables and which express constraints on states of the target system. The formula is processed so as to derive, using the clauses, a proof relating to a property of the target system. After deriving the proof, a variable that has a constant value is identified in the proof. The number of the variables in the proof is reduced using the identified variable, thereby producing a tightened expression, which is applied in making a determination of whether the target system satisfies the formula.Type: ApplicationFiled: July 18, 2007Publication date: January 22, 2009Inventors: Oded Fuhrmann, Ohad Shacham, Ofer Strichman, Tatyana Veksler