Patent application number | Description | Published |
20090106729 | Device, 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 |
20110038542 | COMPUTER 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 |
20110041123 | FINE 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 |
20110055373 | SERVICE 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 |
20110055803 | PLAN-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 |
20110107315 | ABSTRACTING 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 |
20110271252 | DETERMINING 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 |
20110271253 | ENHANCING 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 |
20110302566 | FIXING SECURITY VULNERABILITY IN A SOURCE CODE - 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. Also disclosed are computer program product and data processing system. | 12-08-2011 |
20120227029 | METHOD FOR CODE TRANSFORMATION SUPPORTING TEMPORAL ABSTRACTION OF PARAMETERS - A method of code transformation supporting temporal abstraction of parameters is provided herein. The method includes the following stages: extracting a set of statements from an original code and further creating a residual code being the original code without the statements, wherein two or more of the extracted statements are not on a same loop in the original code; adding conditions from the original code to the extracted set of statements, such that the added conditions are sufficient to render the set of statements executable; adding statements from the original code to the residual code, such that the added statements are sufficient to render the residual code executable; and adding code portions and variables to the set of statements and the residual code, such that a passing of values between the enhanced set of statements and the residual code maintains a respective passing of values in the original code. | 09-06-2012 |
20120304161 | DETERMINING SUITABLE INSERTION POINTS FOR STRING SANITIZERS IN A COMPUTER CODE - A method of determining suitable insertion points for inserting string sanitizers in a computer code is provided herein. The method includes the following stages: obtaining: (i) a computer code associated with a data flow of externally supplied data, from one or more sources to one or more sinks, (ii) locations of the sources, and (iii) locations of the sinks; building a graph representing control paths, data paths and semantic relationships between the control paths and the data paths of the computer code; associating all tainted data paths on the graph, being data paths that go from sources to sinks and do not include a sanitizer; and determining, on the tainted data paths, potential control paths suitable for sanitizer insertion. | 11-29-2012 |
20130018901 | Search Optimization In a Computing EnvironmentAANM Bnayahu; JonathanAACI HaifaAACO ILAAGP Bnayahu; Jonathan Haifa ILAANM Landau; ArielAACI NesherAACO ILAAGP Landau; Ariel Nesher ILAANM Nisenson; MordechaiAACI HaifaAACO ILAAGP Nisenson; Mordechai Haifa IL - Systems and methods for verifying membership in one or more sets that are subsets of a global set are provided. The method compromises representing members of the global set by mapping each member to a distinct Boolean variable of length d, wherein 2 | 01-17-2013 |
20130067436 | ENHANCING 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. | 03-14-2013 |
20130074039 | DETERMINING 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. | 03-21-2013 |
20130117725 | USING TRACEABILITY LINKS STRENGTH FOR SOFTWARE DEVELOPMENT INTEGRITY MONITORING - A method for monitoring requirements integrity. The method comprises receiving a plurality of requirements for an application development project having a plurality of code elements, computing a first strength for each of a plurality of traceability links each between a certain code element in a current software code version of the application development project and one of the plurality of requirements, computing a second strength for each of said plurality of traceability links in a new software code which includes a revision to the certain code element from said current software version, and generating an inconsistency notification based on a deviation between said second strength and said first strength. | 05-09-2013 |
20130133075 | FIXING SECURITY VULNERABILITY IN A SOURCE CODE - 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. Also disclosed are computer program product and data processing system. | 05-23-2013 |
20130247002 | ABSTRACTING 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. | 09-19-2013 |
20130247015 | PLAN-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. | 09-19-2013 |
20140189656 | Flow Analysis in Program Execution - Machines, systems and methods for distinguishing feasible paths in a program by statically tracking one or more execution paths are provided. The method comprises reading one or more program statements in an execution path; adding a location identification for the program statement read to an abstract representation of the execution stack at the time the program statement is executed, in response to determining that the program statement is a procedure call; updating the abstract representations of the execution stack to exclude infeasible execution paths for a possible point in program where the procedure could return or continue, in response to determining that the program statement is a return from a procedure. | 07-03-2014 |
20140278476 | IDENTIFYING ADDITIONAL VARIABLES FOR APPRAISAL TABLES - A computerized method of identifying additional influential variables in multi-aspect adjudication frameworks comprising: acquiring an appraisal table having a set of variables affecting at least one adjudication aspect of a multi-aspect adjudication framework; identifying a set of additional variables affecting at least one adjudication aspect of a multi-aspect adjudication framework which fulfills an objective function, said objective function having a plurality of rules, said objective function assessing the compliance of at least one of said appraisal table and said set of additional variables with said plurality of rules; and outputting said set of additional variables. | 09-18-2014 |
20140278559 | ADJUDICATION PLATFORM COMPLIANCE MANAGEMENT - A method of verifying compliance of an adjudication platform with a requirement, the method comprising: applying a requirement to an adjudication platform, wherein said adjudication platform comprises a plurality of benefit rules and said requirement comprises a plurality of requirements representing at least one of a law and an insurance policy; identifying at least one of said plurality of benefit rules disagreeing with at least one of said plurality of requirements, responsive to a discrepancy between applied said requirement and said adjudication platform; outputting at least one of identified said plurality of benefit rules and said plurality of requirements. | 09-18-2014 |
20150040105 | SYSTEM AND/OR METHOD FOR COMPUTING INTERPROCEDURAL DOMINATORS - 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. | 02-05-2015 |