Abstract: Methods for accessing impact analysis repositories and transaction-refinement index for each of the impact analysis repositories. According to the obtained transaction-refinement index, associating the combined repository with information from the most transaction refined impact analysis repository. Associating the combined repository with information from the less transaction refined impact analysis repository in the case of a request to insert or delete a table record for tables that do not contain any impacted transaction in the more transaction refined impact analysis repository. And associating the combined repository with information from the less transaction refined impact analysis repository in the case of a request to update a table record for table columns that do not contain any impacted transaction in the more transaction refined impact analysis repository.

Abstract: Executing semiautomatically a functioning test scenario to enable a non-programmer user to generate a new test scenario based on the functioning test scenario, including: recording the non-programmer user while interacting with the semiautomatic execution of the functioning test scenario; and generating the new test scenario based on the recording; wherein the semiautomatic execution enables the following features: automatically entering data inferred from the functioning test scenario into a form of a data-oriented large-scale software system; and enabling the non-programmer user to: change the automatically entered data, add a new form to the semiautomatically executed functioning test scenario, and enter data into fields inside the new form.

Abstract: One non-limiting embodiment of the invention comprises the steps of accessing at least two impact analysis repositories, calculating a combined impact analysis repository from the at least two impact analysis repositories, and utilizing the combined impact analysis repository for supplying better quality impact analysis results.

Abstract: A novel and useful mechanism for optimizing the detection of dependencies in a software system via feedback between static and dynamic engines. The present invention enables dynamic analysis to be more effective by using the results of static analysis to identify sections that need to be traced during dynamic analysis. The method also increases the accuracy of static analysis by using dynamic values as inputs to static analysis. Dynamic values used as inputs for static analysis are a result of dynamic analysis. The mechanism first executes a static analysis, then executes a dynamic analysis targeting the sections identified by the static analysis and finally executes a static analysis using the dynamic values identified during the dynamic analysis in order to detect dependencies.

Abstract: One non-limiting embodiment of the invention comprises the steps of accessing at least two impact analysis repositories, calculating a combined impact analysis repository from the at least two impact analysis repositories, and utilizing the combined impact analysis repository for supplying better quality impact analysis results.

Abstract: A novel and useful mechanism for optimizing the detection of dependencies in a software system via feedback between static and dynamic engines. The present invention enables dynamic analysis to be more effective by using the results of static analysis to identify sections that need to be traced during dynamic analysis. The method also increases the accuracy of static analysis by using dynamic values as inputs to static analysis. Dynamic values used as inputs for static analysis are a result of dynamic analysis. The mechanism first executes a static analysis, then executes a dynamic analysis targeting the sections identified by the static analysis and finally executes a static analysis using the dynamic values identified during the dynamic analysis in order to detect dependencies.

Abstract: A system and method for analyzing a computer program comprising a first multiplicity of elements having a second multiplicity of functional relationships defined therebetween, the first multiplicity of elements including interface elements and non-interface elements, the method comprising reading source code, finding at least selected interface elements in the source code, and identifying, and displaying to a user, only those functional relationships which are defined between the selected interface elements.

Abstract: Described is a method and system for performing path-sensitive value flow analysis on a software program. Concrete state and value alias information is tracked along each statement and each relevant path in an abstract program and is stored as a symbolic state in a symbolic store. The value alias information includes a first set of aliases that identify aliases for a designated value that is being analyzed and a second set of aliases that identify possible aliases for the designated value. The value alias information is obtained using imprecise memory alias analysis. Along each relevant path for each statement, transforms are applied to the sets of aliases to update the first and second sets of aliases. The transforms are applied based on the type of statement being processed. Symbolic states existing at the same location are merged if the value alias information is identical within the symbolic states.

Abstract: Described is a method and system for performing path-sensitive value flow analysis on a software program. Concrete state and value alias information is tracked along each statement and each relevant path in an abstract program and is stored as a symbolic state in a symbolic store. The value alias information includes a first set of aliases that identify aliases for a designated value that is being analyzed and a second set of aliases that identify possible aliases for the designated value. The value alias information is obtained using imprecise memory alias analysis. Along each relevant path for each statement, transforms are applied to the sets of aliases to update the first and second sets of aliases. The transforms are applied based on the type of statement being processed. Symbolic states existing at the same location are merged if the value alias information is identical within the symbolic states.