Abstract: Software intended to operate in a clustered environment can be tested for appropriate failover behavior through the use of an automated tool which allows failover to be simulated without requiring that the application be deployed in a cluster environment and observing the effects of actual failover. Such an automated tool can measure the characteristics of one or more session objects created by the application and provide appropriate messages for a developer when those characteristics indicate improper coding for failover.

Abstract: A method is provided for isolating errors which occur when code supplied by independent software vendors (ISV code) interacts with code supplied by a primary vendor (host code). Code suspected of containing ISV code with host code is executed. If the results are in error, the code is scanned and then compared with a master host code. Any differences are stored in a delta file, including locations in the host code where ISV code hooks into the host code. The code is then modified to by-pass the hooks to ISV code to generate a side-executable code and both codes are executed and the results are compared. A lack of substantial difference in the results is indicative that the ISV code adversely affects the host code while a difference between the results is indicative of an error in the modified code.

Abstract: Automated injection of Java bytecode instructions for Java load time optimization via runtime checking with upcasts. Exemplary embodiments include a method including generating a stack for each of a plurality of bytecodes, generating a subclass configured to keep a history of instructions that have modified the stack, statically scanning a plurality of Java classes associated with the plurality of bytecodes to locate class file configurations and bytecode patterns that cause loading of additional classes to complete a verification of each of the classes in the plurality of Java classes, rewriting the bytecodes to delay the loading of the additional classes until required at a runtime, recording modifications that have been made to the stack by the instructions, and applying the modifications to each of the bytecodes in the plurality of bytecodes.

Abstract: The present invention generally relates to computer software, and more specifically, to a computerized utility for analysis of optimized program files. A method and apparatus for optimized program analysis is disclosed.

Abstract: A system and method for generation of efficient calls from compiled byte code within a virtual machine (VM) or Java Virtual Machine (JVM) environment. Current techniques used to interface dynamically compiled byte code with native libraries using stubs are unsatisfactory due to non-optimal performance and the large amount of manual work needed to maintain the stub generation code. An embodiment of the present invention addresses this by providing a system and a method for automatic stub generation based on a small set of parameters stored in a ParamInfo structure. In accordance with an embodiment, the system comprises a computer with native libraries; a virtual machine for executing a software application; a memory space for the compiled byte code; and a compiler with a calling convention adaptor that integrates native calls into the high level analysis step of the compilation of byte codes, so that the overhead for the native call is reduced.

Abstract: System and method for merging graphical programs. Information is received regarding first, second, and third graphical programs, where the third graphical program is an ancestor graphical program of the first and second. The information is analyzed to determine differences among the graphical programs. The first and second graphical programs are merged based on the determined differences, generating a merged graphical program, which is displayed.

Abstract: An integrated development system for editing computer software code defines an annotation that includes an annotation identifier, at least one value, and an associated language for each value. The system displays the annotation identifier with a first value in an editing user interface. The system detects that a user is editing the first value. In response to the detecting, the system automatically revises the display of the first value based on a corresponding first language.

Abstract: A method provides an annotated language extension for the class of an object, the extension identifying an internal state that may be exposed via simple accessor methods. The extension could apply to an entire object type, or to a specific state within the object. Annotations that can be added to the extension include @Accessable, @Gettable and @Settable. In one embodiment, a method selectively accesses one or more object states. The method includes generating an annotated extension identifying each internal object state to be exposed for access, adding a usage annotation to the extension that defines an accessor method associated with each identified state, and operating a virtual machine to call the accessor method associated with a particular identified state. The particular state may then be accessed, as defined by the called accessor method.

Abstract: A method of verifying a software system includes receiving a description of a software system described utilizing a high-level modeling language, and responsive thereto, parsing the description and constructing an abstract syntax graph. The abstract syntax graph is transformed into a sequential logic representation of the software system. The sequential logic representation is formed by reference to a Hardware Description Language (HDL) library. Then, the sequential logic representation is transformed into a gate-level sequential logic representation. Following the transforming, the software system is verified based upon the gate-level sequential logic representation. Following verification, results of verification of the software system are output.

Abstract: A development system is provided. The system includes a workspace component to visually display one or more model components. A separation component automatically segments the model components into two or more project components. A synchronization component can be provided to automatically update at least one of the project components in view of changes made to at least one other project component.

Abstract: Methods, systems, and apparatus, including medium-encoded computer program products, for software installation and icon management support. In one aspect, a method includes obtaining a cross-platform package of information stored in a platform independent format, the cross-platform package information including a cross-platform icon and one or more descriptors for the cross-platform icon; translating the cross-platform icon to a predefined icon format for a specific operating system (OS) on a computer; and providing the translated icon in the predefined icon format for display by the OS on the computer.

Abstract: A mechanism is provided for linking with source code, code commentary relating to the source code's execution. An advantage is achieved by storing the code commentary received from a user during software debugging about a program's execution directly alongside the source code.

Abstract: A system and method for receiving a server request, determining whether one of a plurality of servers scheduled to receive the server request is available, wherein the availability of the one of the servers scheduled to receive the request is based on a first stored value and a second stored value, incrementing the second stored value by a predetermined amount when the one of the servers is unavailable and directing the server request to another one of the plurality of servers based on the first and second stored values.

Abstract: A mechanism is provided for executing an interpreted programming language application from a server at a designated virtual machine on a client computer. A manifest file is extracted which indicates at least one resource for the interpreted programming language application as well as the repository file that provides the at least one resource. The repository file is located in a web start cache and copied to a run directory accessible by the designated virtual machine, outside the web start cache. After terminating the web start application, a particular virtual machine is designated from a plurality of virtual machines based upon the run directory to which the bootstrap class copied the resource repository file thereby forming the designated virtual machine. The interpreted programming language application is then executed from the run directory using the at least one resource.

Abstract: An adaptor provides functionality in a second version of a software to a first version by determining at least one functionality available in the second version but not available in the first version; determining a reuse or adaptation of an adaptor framework in the first version; mapping the functionality of the second version to the first version; importing code in the second version to the first version; and deploying the adaptor framework in the first version.

Abstract: The present invention provides dynamic configuration and allocation of resources in a data center. These resources are monitored for availability and performance information according to their assigned execution (or application) environments. The measured performance information for each environment is used to predict levels of demand for an application in the environment. From the predicted levels of demand resource requirements can be determined to provide a predetermined level of performance under the demand changes. The resources can then be reconfigured or reallocated to different environment so that the requirements of each environment can be met.

Abstract: In a data processing system, a marked bit is used to identify a data access instruction throughout the pipeline to indicate that the instruction meets user-specified criteria (e.g., a meets a data address range of interest). Based on the marked bit, an in-order program correlation message is generated which indicates when the data access instruction occurs relative to the instruction stream. The marked bit is also used to generate an in-order data trace message. As a result, the trace streams including only data access instructions meeting user-specified criteria may be post-processed and correlated precisely.

Abstract: Techniques for developing a graphical editor using an incremental development approach. Externally-stored descriptors are used to specify information on which a graphical editor engine operates to create a graphical editor. Developers can thus redefine the look and feel of the graphical editor by modifying these descriptors, effectively re-configuring the elements of visual models without changing the code of the graphical editor engine. Visual models for modeling a domain can be created and used, without first requiring the domain model to be defined.

Abstract: The invention relates to a method of designing a system. The system includes an application having software components and an architecture having hardware components on which the application is run. The system has to satisfy at least one functional and one non-functional requirement. The functional analysis step (11) obtains a breakdown of the functional need relating to the application. A step defines the architecture (12). A step for designs hardware components (13) according to the architecture. A step design software components (14) based on the breakdown of the functional need. A step for integrates the software components in the hardware components (15). A step validates the functional requirements of the system (16). A step validates the non-functional requirement of the system (17). An upstream step (21) validates the non-functional requirement of the system, preceding the steps for designing hardware components (13) and software components (14).

Abstract: A method, apparatus, and computer instructions for referencing a constant pool. A determination is made as to whether a bytecode references the constant pool. A relative offset to the constant pool is identified for the bytecode, in response to the bytecode referencing the constant pool. The bytecode is then replaced with a new bytecode containing the relative offset. The relative offset is used to reference the constant pool.