Abstract: An automated analysis system detects malicious code within a computer system by generating and subsequently analyzing a behavior pattern for each computer program introduced to the computer system. Generation of the behavior pattern is accomplished by a virtual machine invoked within the computer system. An initial analysis may be performed on the behavior pattern to identify infected programs on initial presentation of the program to the computer system. The analysis system also stores behavior patterns and sequences with their corresponding analysis results in a database. Newly infected programs can be detected by analyzing a newly generated behavior pattern for the program with reference to a stored behavior pattern to identify presence of an infection or payload pattern.

Abstract: An execution engine synchronizes test suite execution to run multiple independent operations concurrently or in parallel. The execution engine operates by stepping through the test suite. At each step it runs the required number of independent operations and waits for their completion. It then checks the results, and continues to the next step of the test suite. If at any step, the actual results are different from the expected results, then the exact sequence that triggered the fault is known. The sequence can be repeated when a correction is provided for the fault. Furthermore, the execution engine allows the user to interactively step through a test case when debugging a fault. A synchronization pattern generator may be incorporated in the system to generate minimal numbers of repetitions of test cases to guarantee varying degrees of interaction coverage.

Abstract: An upgrade method for navigation data is provided with: a memory status of a memory device that is removed from a navigation apparatus is checked and it is determined whether there are the navigation data to be upgraded and the user data to be saved. The user data is saved in a backup memory device. The navigation data is written over with upgraded navigation data. Then, the saved data is read from the backup memory device and rewritten in the memory device as the user data.

Abstract: A method to just-in-time (JIT) compile Java software methods, the method having the steps of: initializing a first counter for a first software method to a first value, the first value being adjusted each time the first software method is invoked; initializing a second counter for a second software method to a second value, the second value being different from the first value, and the second value being adjusted each time the second software method is invoked; responsive to a determination that the first value exceeds a particular value, JIT compiling the first software method; responsive to a determination that the second value exceeds the particular value, JIT compiling the second software method.

Abstract: A new method is disclosed, for upgrading the software in a real-time distributed software system comprising several processes running in parallell. The method involves a preparatory procedure in which the new software is installed. Then, the software is activated, the components ordered to save configuration data and transaction data in a database, whereupon the components are stopped. When the preparatory procedure is completed, a restart procedure is invoked. This involves selecting start level (full upgrade involving all components, or a partial upgrade concerning just one or a few components). The modules concerned are started from the new software version. On each start level a number of start phases are defined. These are sequential steps performed during the restart operation. Each module subscribes to a number of these phases. Some of the phases are defined as synchronisation points, here called service levels, which all modules have to arrive at before the process is allowed to commence.

Abstract: A modular parser architecture and methods related thereto make use of a number of miniparsers. Each miniparser is capable of receiving input and generating an output dependent thereon. In one embodiment, a lexer or a miniparser capable of lexical analysis receives certain code and provides an abstract syntax tree. Each miniparser performs operations on a set of syntactical constructs to produce a corresponding output syntax tree, which in turn may become an input syntax tree for a next miniparser which may operate on a different set of syntactical constructs.

Abstract: Connection objects or other such data structures facilitate establishing and configuring connections between objects that model components in a process control system. A first set of data structures (e.g. the object connection type structures) identify valid types for component-to-component pairings and the respective roles of each component in the pairing (e.g., parent or child, source or sink). A second set of data structures (e.g., the parameter connection type structures) supply similar information for parameter-to-parameter connections. Together, these data structures can be used, for example, to validate component-to-component connections suggested by the user and to automatically configure parameter-to-parameter connections. Actual connections, both at the component or parameter level, are reflected using parameter overrides within the parameterized object model—with which the connection objects are constructed.

Abstract: A software system for installation on computing apparatus (and a method of installing such a software system on computing apparatus), wherein the software system is provided in the form of a software package including a plurality of software components, one or more of the software components being provided as a plurality of different implementations, the apparatus including an installation engine for installing the software system only a selected one implementation of the or each of the software components having multiple implementations, and a random selector module for selecting one of the plurality of implementations of a software component for installation.

Abstract: A method and an apparatus for adapting for a kernel on a target system a compiled kernel module corresponding to another kernel version which is different from the kernel on the target system are provided. A kernel analyzer extracts from the kernel on the target system an error check measure and a kernel version identification. A module adaptation component inserts in the compiled kernel module an error check parameter corresponding to the error check measure extracted by the kernel analyzer from the kernel on the target system, and replaces a version identification in the compiled kernel module with the kernel version identification extracted by the kernel analyzer from the kernel on the target system.

Abstract: A system and method for EJB classloading. By changing the EJB classloading scheme so that the EJB impl class is loaded in a child ClassLoader, the system allows the old EJB impl class to be replaced with a new one without disturbing the rest of the deployment. The key to doing this is to remove all direct references to the EJB impl class from classes loaded in the parent ClassLoaders. Removing this dependency allows the old EJB impl class to be replaced at any time with a new impl class.

Abstract: The present invention discloses a method of developing a software system. The method facilitates the task of checking the software system's conformity to design during development, testing, and maintenance. A design control flow graph describes how the software system is to operate. Coding of the software system proceeds with reference to the design control flow graph. The design control flow graph can also be used as a framework for the construction of a monitoring module that comprises a collection of functions for checking the coding of the software system. During development, each node in the software system executes a corresponding monitoring function of the monitoring module. The monitoring function verifies, for example, whether the node was entered from a valid predecessor node, and whether some or all variables visible to the node have permissible values.

Abstract: A system and method for a deployment tool is provided. The deployment tool in one aspect assembles and deploys software components generated by any predetermined standard compliant application tools. The system and method in one aspect isolates each application server's specific deployment logic into plug-in modules. A user is provided with a series of input tools or panels for specifying deployment variables and customizing the deployment as needed. The customization includes the ability to select the target application server and optionally, the target platform and operating system.

Abstract: The service function and information design process is automated in order to shorten the design process period. The same process is based upon the relationships between activities and the information that the activities provide and consume. The relationships are maintained in a predetermined format and are updated by any changes that are affecting the relationships. In addition, the activities are further defined by detailed activities.

Abstract: The present invention comprises apparatus and systems for measuring, monitoring, tracking and simulating enterprise communications and processes. A central message repository or database is constructed, comprised of monitoring messages sent from process messaging systems. The database may then be accessed or queried as desired. A simulation tool assists in reviewing present and proposed processes and sub-processes before modifying existent systems or creating new systems.

Abstract: A method for computing an out of place FFT in which each stage of the FFT has an identical signal flow geometry. In each stage of the presently disclosed FFT method the group loop has been eliminated, the twiddle factor data is stored in bit-reversed manner, and the output data values are stored with a unity stride.

Abstract: Methods and systems consistent with the present invention provide an improved software development tool that represents multiple dependencies between a dependent node and a defining node in a project as a single dependency link. Methods and systems consistent with the present invention also identify and display details regarding each dependency in a project upon request by the user.

Abstract: In an enterprise having multiple computers with differing systems, atribute information including contact information and host information is first installed on the computers in a system independent manner. Then this information is adjusted in accordance with the perticular system on each computer.

Abstract: Methods and systems consistent with the present invention provide an improved software development tool that generates code corresponding to a distributed computing component that contains methods of a plurality of types and that displays a graphical representation of the code with a separately delineated display area for each type. The improved software development tool also compiles, deploys, and debugs the distributed computing component with a client software component using methods and systems consistent with the present invention.

Abstract: A process and system for externalizing classloader information to non-application modules such as tool modules that do not reside within the same Application server virtual machine such as a J2EE AppServer JVM. Tools that read and display classloader information typically need to co-reside within the AppServer because of the virtual machine security mechanisms that prevent classes outside the virtual machine itself to introspect the classloaders. This presents a problem for tooling vendors because most server owners do not want anything other than their applications running within the AppServer virtual machine. The invention allows tooling vendors to create a classloader tool that is external to the AppServer virtual machine, and which is running in a completely separate virtual machine, thus having minimal overhead on production systems, but which allows classloading through standard or open (e.g. non-proprietary) interfaces.

Abstract: A computer implemented method (200) is described for determining the equivalence of two sets of simultaneous linear algebraic equations. Each of said equations is of a form: ei1x1+ei2x2+ei3x3+ . . . +eiixn=bi where xj are unknowns, eij are coefficients and bi are quantities, and defining the relationship between the unknowns within the set. The coefficients and quantities are known algebraic expressions. The unknowns are iteratively eliminated (250 to 280) from each of the sets of simultaneous linear algebraic equations until each of said equations are in the form: (lii)kxi=(ri)k wherein lii and ri are algebraic expressions, and k={1;2} indicate one of said sets that said equation is derived from. The products (lii)1*(ri)2 and (lii)2*(ri)1 are compared (300) for each of the unknowns. Only if the products match (310) for all the unknowns are the two sets of simultaneous linear algebraic equations equivalent (312). An apparatus (100) for performing the above method (200) is also provided.