International Business Machines Corporation

Yishai Abraham Feldman

Aharon Abadi

Jonathan Bnayahu

Moria Abadi

Ran Ettinger

Adi Sharabani

Yinnon Avraham Haviv

Evgeny Shindin

Omer Tripp

Omri Weisman

Sergey Zeltyn

Idan Ben-Harrush

Maayan Goldstein

Eliezer Segev Wasserkrug

Mohammad Sadoghi Hamedani

Amos Cahan

Segev Eliezer Wasserkrug

Alexander Zadorojniy

Inbal Ronen

Michael Masin

Lior Limonad

Padmanabhan Santhanam

Aviad Sela

Sara Porat

Lan Ngoc Hoang

Yael Dubinsky

Eyal Shnarch

Nurit Dor

A system and a method for increasing the classification confidence, with lesser dependence on large sets of training data, obtained by one or more machine learning based algorithms, by analyzing unstructured information using unstructured analysis pipeline comprising a probabilistic network such as a Bayesian network. The probabilistic network may comprise nodes associated with elements and cues defined by experts, and require fewer labelled data samples to train. The confidence level of the elements may be determined by machine learning and unstructured analysis methods and processed by the probabilistic network to estimate the confidence for a characterization quantity.

Method and system for unstructured information analysis using a pipeline of ML algorithms

A control system, computer program product, and method for generating a logically-represented policy for a control system operating based on a CMDP model are provided. The control system directs the operation of a controlled application system that is subject to a constraint. The method includes receiving, at the control system, data corresponding to control action variables and system state variables relating to the controlled application system, data corresponding to a cost/reward, and data corresponding to the constraint, and automatically training a CMDP model for the operation of the controlled application system based on the received data, where the CMDP model is formulated using dual linear programming, and where the CMDP model includes a policy corresponding to occupation measures that are decision variables of the dual linear programming formulation. The method also includes automatically generating a logically-represented policy for the control system based on the policy of the CMDP model.

Generating logically-represented policy for control systems operating based on constrained Markov decision process (CMDP) models

A system for generating a statistical model for fault diagnosis comprising at least one hardware processor, adapted to: extract a plurality of structured values, each associated with at least one of a plurality of semantic entities of a semantic model or at least one of a plurality of semantic relationships of the semantic model, from structured historical information organized in an identified structure and related to at least some of a plurality of historical events, the semantic model represents an ontology of an identified diagnosis domain, each of the plurality of semantic entities relates to at least one of a plurality of domain entities existing in the identified diagnosis domain, and each of the plurality of semantic relationships connects two of the plurality of semantic entities and represents a parent-child relationship therebetween; extract a plurality of unstructured values, each associated with at least one of the plurality of semantic entities.

System and method for semantics based probabilistic fault diagnosis

A computer-implemented method includes identifying at least one parse tree. The method includes identifying a pattern library. The method includes searching the pattern library for patterns that match at least one fragment of any of the at least one parse tree. The method includes determining whether the at least one parse tree is fully matched by a combination of matching patterns from the pattern library. The method includes ranking the at least one parse tree based on an extent to which the at least one parse tree is fully matched by the combination of matching patterns from the pattern library.

Evaluating parse trees in linguistic analysis

Examples of techniques for the real-time capture and translation of human thoughts and ideas into structured patterns are disclosed. In one example implementation according to aspects of the present disclosure, a computer-implemented method may include capturing, by a processing device, unstructured data. The method may also include extracting key terms from the unstructured data. Additionally, the method may include assigning an attribute to at least one of the key terms. The method may further include generating, by the processing device, a structured pattern based on the key terms and the attributes.

Real-time capture and translation of human thoughts and ideas into structured patterns

Embodiments of the present invention provide a method and system for finding uninitialized variables outside the local scope. Initially, a source code of a program is received. The source code may include multiple functions. A checked scope is determined for at least one variable in the source code. The checked scope includes a local scope. Additionally, the local scope is accessed using at least one function call of the functions. Static analysis is run, covering the checked scope for the at least one variable in the source code. At least one inter-procedural dependency is identified to determine whether the at least one variable in the local scope is uninitialized. Responsive to determining that the at least one variable in the local scope is uninitialized the at least one variable is displayed to a user.

Finding uninitialized variables outside the local scope

According to an aspect of some embodiments of the present invention there is provided a computerized method of analyzing code of a software program for dominance relationships between a plurality of functions of the software program, the method comprising: receiving source code of a software program, the source code having a plurality of functions; identifying a plurality of intraprocedural dominator graphs each for another of the plurality of functions; combining the plurality of intraprocedural dominator graphs to create an interprocedural dominance graph with edges that logically connect between nodes of the plurality of functions; identifying a plurality of interprocedural dominance relations between nodes in different functions of the plurality of functions using the interprocedural dominance graph; and analyzing the software program according to the plurality of interprocedural dominance relations.

System and/or method for computing interprocedural dominators

A computer implemented method of automatically generating tests for COBOL code units, comprises using at least one hardware processor adapted to designate a COBOL source code comprising a plurality of code lines, extract automatically a plurality of code units each comprising a subset of the code lines for executing one or more functionalities of the COBOL source code, the code units are identified by analyzing the plurality of code lines, generate automatically one or more tests for testing each of the code units by generating an input stimulus for each of the code units, and create one or more mock code segments to simulate interaction of each code unit with one or more external code segment comprising code lines not included in the code unit and testing each code unit using the one or more test(s).

Auto-generation of testable units for COBOL code

A method comprising: obtaining a first viewpoint representing a partial depiction of a system, wherein the first viewpoint comprises a property base, an instance base and a class base; obtaining a second viewpoint representing a partial depiction of the system, wherein the second viewpoint comprises a property base, an instance base and a class base, wherein the instance base of the second viewpoint is different than the instance base of the first viewpoint; creating a third viewpoint based on the first and second viewpoints, wherein the third viewpoint representing the system, wherein the third viewpoint comprises a property base, an instance base and a class base, wherein the instance base comprises instances defined by the instance base of the first viewpoint and instances defined by the instance base of the second viewpoint.

Representing a system using viewpoints

The present invention, in some embodiments thereof comprises a computer implemented method of detecting global variables in JavaScript code, and adding local variables in place of the global variables, comprising receiving a JavaScript code containing at least one of a plurality of globally defined functions, identifying at least one of: one or more confined global variables which receive a value within a first JavaScript scope wherein the value is not referenced outside of the first JavaScript scope, and one or more repeating global variables accessed repeatedly within a second JavaScript scope, and adding local variables in place of at least one of the confined global variables and the repeating global variables.

Method of adding local variables in place of global in JavaScript

A method of improving software architecture by untangling undesired code level dependencies is provided herein. The method includes the following stages: generating an abstract representation of a computer code in a form of a code model; recording manipulations to the computer code applied by a user to the code model; calculating a series of refactorings in the computer code that represents the recorded manipulation; and carrying out the refactorings within the computer code. Specifically, some of the refactorings include separating low level software elements on the method level in response to the user manipulations of the model.

Software architecture by untangling undesired code level dependencies using code refactoring

A computer implemented method for automatically fixing a security vulnerability in a source code is disclosed. The method includes obtaining identification of code that sends tainted data to corresponding sink code in the source code; and automatically fixing the vulnerability by automatically performing code modification which is selected from the group of code modifications consisting of: code motion and code duplication.

Fixing security vulnerability in a source code

Disclosed are methods for finding all valid paths in a COBOL program. These methods are performed in polynomial time, allowing them to be scaled to accommodate large COBOL programs. As the methods find all valid paths in COBOL program code, by traversing and marking the nodes of the program upon being traversed. Accordingly, all usable and reachable code is indicated and marked. This increases safety when working with the code, as removal or alteration of such valid code is indicated, and thus, made unlikely.

Growing community of inventors

Tel Aviv, Israel

Yishai Abraham Feldman