Abstract: A computer system, method and computer program product for automatically converting, through automating-test-automation software, a manual test case representation (in a natural language), for testing a target software, into a machine-readable test case representation. In preferred embodiments, the machine-readable test case is in the form of a keyword-based test case that is made from action-target-data tuples. The automation-test-software uses a methodical process of trial-and-error to resolve ambiguities that are generally present (and generally resolvable by humans) in the manual test case representation.

Abstract: Techniques, an apparatus and an article of manufacture for generating test cases for covering enterprise rules and predicates. A method includes obtaining a web application and a specification of at least one enterprise rule, constructing a link graph that captures at least one navigation path in the web application, and performing a traversal of the web application guided by the link graph to generate an executable test case that drives the web application along one of the at least one navigation paths in which the at least one enterprise rule is covered to determine the web application's conformance to the at least one enterprise rule, wherein the executable test case is a sequence of one or more test steps, each test step representing an action to be performed on the web application and/or a verification of the application state.

Abstract: Techniques for static code analysis are provided. The techniques include routing a code analysis request to a set of one or more static code analysis tools based on a context of the request, merging one or more tool-specific outputs of the code analysis, wherein merging the one or more tool-specific outputs comprises using one or more tool-specific mappings to one or more static code analysis abstractions and one or more source linkages of one or more static code analysis defects, performing a deep analysis on a set of one or more defect categories, and combining results of the merging with the deep analysis to filter out one or more false-positives and to add one or more new true positives to create an optimal set of defects.

Abstract: Systems and associated methods for automated repair support for input model faults are described. Embodiments automate generation of fault repair support by producing one or more repair action suggestions for a given input model containing faults. Responsive to an indication of one or more faults within the model, embodiments utilize a fault index to ascertain the nature of faults within the model and to compile one or more repair action suggestions. Users can review the repair action suggestions, and preview the impact each of these suggestions will have on the model if implemented, and select an appropriate repair action for repairing a model containing faults.

Abstract: Techniques, an apparatus and computer program product for generating test cases for covering enterprise rules and predicates are disclosed by receiving data associated with at least one of a business requirement and a business scenario as input, wherein the data comprise at least one of a set of predefined rules; based on the data, generating at least one or more test cases as output without any human intervention, wherein the output comprises a test script for the business requirement or the business scenario, and wherein the data associated with the at least one of a business requirement and a business scenario comprise at least one of a business rule, business requirement and predicate, the data associated with the at least one of business requirement and business scenario are stored as a linked graph in a repository, and wherein each node of the linked graph is mapped to previously stored data in the repository, wherein the repository comprises either one of a structured or unstructured data, and the data

Abstract: Methods and arrangements for employing a software model transform. A software model transform is accepted, and the transform is manipulated to obtain a transform representation. At least one functional path is explored with respect to the transform representation. A trace is conducted of at least one explored path, and an abstraction of the transform is produced via utilizing the trace, the abstraction comprising a simplified semantic view of the transform.

Abstract: Techniques, an apparatus and an article of manufacture for generating test cases for covering enterprise rules and predicates. A method includes obtaining a web application and a specification of at least one enterprise rule, constructing a link graph that captures at least one navigation path in the web application, and performing a traversal of the web application guided by the link graph to generate an executable test case that drives the web application along one of the at least one navigation paths in which the at least one enterprise rule is covered to determine the web application's conformance to the at least one enterprise rule, wherein the executable test case is a sequence of one or more test steps, each test step representing an action to be performed on the web application and/or a verification of the application state.

Abstract: Techniques for facilitating use of a transformer are provided. The techniques include analyzing code of a transformer to compute one or more exception constraints and one or more output constraints, translating the one or more exception constraints and one or more output constraints to state them in terms of one or more input and output meta-model elements, wherein translating the one or more exception constraints and one or more output constraints comprises inferring one or more transformer rules in terms of vocabulary of a meta-model, wherein a transformer rule comprises one of a verification rule and a comprehension rule, and using the one or more inferred transformer rules to facilitate use of a transformer, wherein facilitating use of a transformer comprises supporting model verification and transform comprehension.

Abstract: A computer system, method and computer program product for automatically converting, through automating-test-automation software, a manual test case representation (in a natural language), for testing a target software, into a machine-readable test case representation. In preferred embodiments, the machine-readable test case is in the form of a keyword-based test case that is made from action-target-data tuples. The automation-test-software uses a methodical process of trial-and-error to resolve ambiguities that are generally present (and generally resolvable by humans) in the manual test case representation.

Abstract: This application provides to a method for identifying one or more prostate tissue samples in a database that are closest to a test prostate sample, which can be used to aid pathologists when examining prostate tissues to attain reliable and consistent diagnoses of prostate cancer. Also provided are databases and computer algorithms that can be used with such methods.

Abstract: This application provides to a method for identifying one or more prostate tissue samples in a database that are closest to a test prostate sample, which can be used to aid pathologists when examining prostate tissues to attain reliable and consistent diagnoses of prostate cancer. Also provided are databases and computer algorithms that can be used with such methods.

Abstract: Systems and associated methods for automated repair support for input model faults are described. Embodiments automate generation of fault repair support by producing one or more repair action suggestions for a given input model containing faults. Responsive to an indication of one or more faults within the model, embodiments utilize a fault index to ascertain the nature of faults within the model and to compile one or more repair action suggestions. Users can review the repair action suggestions, and preview the impact each of these suggestions will have on the model if implemented, and select an appropriate repair action for repairing a model containing faults.

Abstract: Approaches based on dynamic tainting to assist transform users in debugging input models. The approach instruments the transform code to associate taint marks with the input-model elements, and propagate the marks to the output text. The taint marks identify the input-model elements that either contribute to an output string, or cause potentially incorrect paths to be executed through the transform, which results in an incorrect or a missing string in the output. This approach can significantly reduce the fault search space and, in many cases, precisely identify the input-model faults. By way of a significant advantage, the approach automates, with a high degree of accuracy, a debugging task that can be tedious to perform manually.

Abstract: Techniques for facilitating use of a transformer are provided. The techniques include analyzing code of a transformer to compute one or more exception constraints and one or more output constraints, translating the one or more exception constraints and one or more output constraints to state them in terms of one or more input and output meta-model elements, wherein translating the one or more exception constraints and one or more output constraints comprises inferring one or more transformer rules in terms of vocabulary of a meta-model, wherein a transformer rule comprises one of a verification rule and a comprehension rule, and using the one or more inferred transformer rules to facilitate use of a transformer, wherein facilitating use of a transformer comprises supporting model verification and transform comprehension.

Abstract: Techniques for static code analysis are provided. The techniques include routing a code analysis request to a set of one or more static code analysis tools based on a context of the request, merging one or more tool-specific outputs of the code analysis, wherein merging the one or more tool-specific outputs comprises using one or more tool-specific mappings to one or more static code analysis abstractions and one or more source linkages of one or more static code analysis defects, performing a deep analysis on a set of one or more defect categories, and combining results of the merging with the deep analysis to filter out one or more false-positives and to add one or more new true positives to create an optimal set of defects.

Abstract: Implementations provide a technology for generating a minimum delta between at least two program binaries. An implementation is given a source program (S) in a binary format and a target program (T) in a binary form. It constructs control flow graphs (CFGs) of each. It matches common blocks of the S's CFGs and T's CFGs. The blocks are matched based upon their content and their local neighborhoods. In addition, the register renaming problems is solved so that blocks can be fairly compared. This implementation produces an intermediate output, which is the content of unmatched blocks. It generates a set of edge edit operations for merging the unmatched blocks into S. The combination of the unmatched blocks and the edit operations is the delta. To patch S to produce a reconstructed copy of T, the delta is merged with S.

Abstract: Implementations provide a technology for generating a minimum delta between at least two program binaries. An implementation is given a source program (S) in a binary format and a target program (T) in a binary form. It constructs control flow graphs (CFGs) of each. It matches common blocks of the S's CFGs and T's CFGs. The blocks are matched based upon their content and their local neighborhoods. In addition, the register renaming problems is solved so that blocks can be fairly compared. This implementation produces an intermediate output, which is the content of unmatched blocks. It generates a set of edge edit operations for merging the unmatched blocks into S. The combination of the unmatched blocks and the edit operations is the delta. To patch S to produce a reconstructed copy of T, the delta is merged with S.

Abstract: An implementation of a technology, described herein, for facilitating the protection of computer-executable instructions, such as software. At least one implementation, described herein, may generate integrity signatures of one or more program modules—which are sets of computer-executable instructions—based upon a trace of activity during execution of such modules and/or near-replicas of such modules. With at least one implementation, described herein, the execution context of an execution instance of a program module is considered when generating the integrity signatures. With at least one implementation, described herein, a determination may be made about whether a module is unaltered by comparing integrity signatures. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.

Abstract: An implementation of a technology, described herein, for facilitating the protection of computer-executable instructions, such as software. At least one implementation, described herein, may generate integrity signatures of one or more program modules—which are sets of computer-executable instructions—based upon a trace of activity during execution of such modules and/or near-replicas of such modules. With at least one implementation, described herein, the execution context of an execution instance of a program module is considered when generating the integrity signatures. With at least one implementation, described herein, a determination may be made about whether a module is unaltered by comparing integrity signatures. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.

Abstract: Disclosed is a method of and a system for establishing a logical-model based understanding of a legacy application. The method comprises the steps of providing a physical data model of the legacy application, said physical data model having a plurality of physical elements; establishing a logical data model for the legacy application, said logical data model having a plurality of logical model elements; and establishing links between said logical model elements and said physical elements. One of said physical or logical elements is selected, and said links are used to identify all of the physical or logical elements that are linked to said selected one of said elements.