Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


Jonathan Bnayahu, Haifa IL

Jonathan Bnayahu, Haifa IL

Patent application numberDescriptionPublished
20090106729Device, Method and Computer Program Product for Managing a Software Development Process - A method for managing a software development process, the method includes: receiving information representative of instances of simple software development process events; detecting, by a complex event processing (CEP) engine and in response to the received information, at least one complex situation; and invoking at least one software management process reaction responsive to a detection of the at least one complex situation.04-23-2009
20110038542COMPUTER APPLICATION ANALYSIS - A method, system, and computer program product for computer application analysis are provided. The method for computer application analysis includes monitoring a computer system on which an application to be analyzed is executed and interacted with by a user of the computer system. The monitoring includes: capturing screen data of the application as displayed on a display screen of the computer system including interpreting the screen data using optical character recognition (OCR); and capturing user inputs to the application to input devices of the computer system. The method further includes analyzing the captured screen data and user inputs to generate a summary of the usage of the application.02-17-2011
20110041123FINE SLICING: GENERATING AN EXECUTABLE BOUNDED SLICE FOR PROGRAM - A method for generating a fine slice for a program is provided. The method comprises receiving a set of slicing criteria, wherein the set of slicing criteria comprises one or more variable occurrences or control dependences; receiving a set of cut points, wherein the set of cut points comprises one or more variable occurrences or control dependences; and generating a slice according to the set of slicing criteria and the set of cut points. The generated slice includes statements related to computation of values for the set of slicing criteria and excludes statements related to computation of values for the set of cut points. Missing information is added to the slice so that the slice is executable.02-17-2011
20110055373SERVICE IDENTIFICATION FOR RESOURCES IN A COMPUTING ENVIRONMENT - A method for identifying computational services performed by one or more computing resources is provided. The method comprises analyzing digital data associated with the computing resources to identify similarities between the digital data; grouping sets of digital data into one or more clusters according to similarities identified between the digital data; and generating a description for the one or more clusters to describe at least one computational service associated with a set of digital data grouped in the one or more clusters.03-03-2011
20110055803PLAN-BASED PROGRAM SLICING - A method for generating a slice from a plan-based representation of a program is provided. The method comprises constructing a plan representation of a program, wherein the plan representation comprises a plurality of nodes, edges, and ports; and receiving one or more slicing criteria from a user. The slicing criteria comprise one or more variable occurrences or statements from the program, according to which a slice is generated from the plan representation.03-03-2011
20110107315ABSTRACTING BENEFIT RULES FROM COMPUTER CODE - A method that includes: obtaining a computer code usable to process insurance claims; building a computer readable directed graph representing a control flow of the code, by identifying decisions and actions in the code, the graph comprising nodes connected by edges, some of the nodes being decision nodes associated with the decisions and some of the nodes being action nodes associated with the actions; determining, on the graph, benefit action nodes that are each associated with at least one monetary outcome of a specified insurance claim; identifying all logic paths that lead to each benefit action node by traversing the graph from each benefit action node backwards, each logic path comprising a sequence of preceding decision nodes and action nodes connected by edges, each set of paths being associated with a specified benefit action node representing a benefit rule; and outputting all benefit rules by presenting each specified benefit action vis à vis grouped logic paths associated with the specified benefit action.05-05-2011
20110271252DETERMINING FUNCTIONAL DESIGN/REQUIREMENTS COVERAGE OF A COMPUTER CODE - A method that includes: running a set of functional tests over a computer code; determining, for each code element of the computer code, which functional test covered it, to yield a tests-elements coverage map; associating portions of the computer code with corresponding design portions or requirements derived from a design document or a requirements document respectively, associated with the computer code, to yield a design/requirements-code tracing map; deriving, from the tests-code coverage map and the design/requirements-code tracing map, a design/requirements-tests coverage map, exhibiting coverage of the computer code by the functional tests, in terms of the design or the requirements, wherein at least one of the running, the determining, the associating, and the deriving is executed by at least one processor.11-03-2011
20110271253ENHANCING FUNCTIONAL TESTS COVERAGE USING TRACEABILITY AND STATIC ANALYSIS - A method that may include: building a dependencies graph representing dependencies between code elements of a computer code; associating portions of the computer code with corresponding design specifications or requirements derived from a design specifications document or a requirements document respectively which is associated with the computer code, to yield a design specifications or requirements-code tracing map; and analyzing the design specifications or requirements-code tracing map based on the dependencies graph to yield an ordered list of design specifications or requirements respectively, wherein the order is selected such that functional tests written for the computer code and addressing design specifications or requirements of a higher order, will yield a higher level of functional test coverage of the computer code in terms of design specifications or requirements.11-03-2011