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 method for manipulating an image, the method includes: capturing image information representative of an image that includes images of textual characters; recognizing the textual characters by applying Optical Character Recognition; identifying the layout of the image; and applying at least one de-identification process on textual characters of interest to provide de-identification process results.

Abstract: A method for manipulating an image, the method includes: capturing image information representative of an image that includes images of textual characters; recognizing the textual characters by applying Optical Character Recognition; identifying the layout of the image; and applying at least one de-identification process on textual characters of interest to provide de-identification process 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 code pattern detector including at least one pattern definition expressed in a pattern language, and a code analyzer operative to employ the pattern definition to analyze a code base, the code analyzer including a representation builder operative to construct a representation of the code base, a pattern detector operative to process the representation in conjunction with the pattern definition to find a pattern within the representation, and an inference engine operative to express any of the found patterns as an abstract relationship within the code base.

Abstract: A system and method for detecting the mutability of fields and classes in an arbitrary program component written in an object oriented programming language is disclosed. A variable is considered to be mutable if a new value is stored into it, as well as if any of its reachable variables are mutable. The system and method uses a static analysis algorithm which can be applied to any software component rather than whole programs. The analysis classifies fields and classes as either mutable or immutable. In order to facilitate open-world analysis, the algorithm identifies situations that expose variables to potential modification by code outside the component, as well as situations where variables are modified by the analyzed code. An implementation of the analysis is presented which focuses on detecting mutability of class variables, so as to avoid isolation problems. The implementation incorporates intra- and inter-procedural data-flow analyses and is shown to be highly scalable.

Abstract: An arrangement and method for flow composition model searching by holding in a repository (120) records (130) of flow composition models containing information representative of predetermined flow composition model characteristics thereof, specifying (200) information representative of desired ones of the predetermined flow composition model characteristics, and retrieving from the repository flow control model records matching the specified information. The FCM characteristics may include Message Flow, Work Flow and Connector characteristics. The specified information may include wild card characters. This provides the advantage that a new specification of flow characteristics, derived from the general model FCM, is used. Hence using it enables the application of search, reuse, compare, etc., on any present and future FCM realization.

Abstract: A data structure and associated mechanism for implementing object oriented programming language, comprising at least two code blocks for at least one method of an object of a specified class, each of the code blocks containing a different implementation of the at least one method. An access mechanism is provided for accessing a desired code block at run-time on a per object instance basis so as to allow selection of a desired implementation of the at least one method without requiring instantiation of an object of a different class. The selection of which implementation to invoke is integrated into an existing invocation method of the language and is thus transparent to a calling application invoking the method.

Abstract: A computer implemented technique for the static evaluation of the lifetime of objects allocated in memory is presented, which find application in reducing the overhead of generational garbage collection. The method combines pointer alias analysis with static object size determination, from which accurate generational assignment of newly created objects can be accomplished.

Abstract: A computer implemented technique for the static evaluation of the lifetime of objects allocated in memory is presented, which find application in reducing the overhead of generational garbage collection. The method combines pointer alias analysis with static object size determination, from which accurate generational assignment of newly created objects can be accomplished.