Abstract: A hardware Java™ accelerator is provided to implement portions of the Java™ virtual machine in hardware in order to accelerate the operation of the system on Java™ bytecodes. The Java™ hardware accelerator preferably includes Java™ bytecode translation into native CPU instructions. The combination of the Java™ hardware accelerator and a CPU provides a embedded solution which results in an inexpensive system to run Java™ programs for use in commercial appliances.

Abstract: A method and mechanism for automatically patching software implementations such as applications as they are installed from an external source. A patch program is run for a software implementation that is advertised as available, or is otherwise available, though not yet installed (or fully installed). The mechanism maintains the patch information for that software implementation. Whenever the software implementation is installed, the mechanism determines that the software implementation has the patch information maintained therefor. The mechanism automatically applies the patch as part of the on-demand installation process. The patch may change the files, the values of registry entries and/or the installation logic associated with the software implementation.

Abstract: In the context of a constraint-based or rule-based model, in which nodes are interrelated by constraints, rules, and conditions, addition of and changes to nodes need to be validated against relevant constraints. A mechanism is provided for performing such validation without loading the entire configuration, which includes a set of constraints and a set of node variables. In response to an intent to modify a node, a subset of the set of constraints is determined, which includes all constraints that restrict the intent to modify. Further, a subset of the set of node variables is determined, which includes all node variables that may have values that affect whether any of the subset of constraints is violated. A subset of node variable information is loaded into volatile memory, which includes only information about the subset of node variables, rather than information about all of the nodes of the model.

Abstract: Software reuse instances are found from an execution trace through a process of quantization, discovery, and synthesis. Quantization includes mapping n-dimensional vectors that correspond to instructions, live-in states, and live-out states to one dimensional symbols, and arranging the symbols into a text in program execution order. Discovery includes the identification of recurrent symbols and recurrent phrases of symbols within the text. Recurrent symbols and phrases correspond to reuse instances. Compression algorithms are applied to identify the recurrent symbols and phrases. Synthesis can include correlating the reuse instances with the binary program to identify the reuse regions within the software program. Synthesis can also include generating non-essential code and corresponding triggers for a conjugate processor.

Abstract: Embodiments of a system and method for hierarchically organizing rules and for evaluating and executing the hierarchy of rules. Each rule in the hierarchy of rules may include a precondition and an action to be executed if the precondition is met. When evaluating and executing the rules, if a precondition of a rule in the hierarchy is not met, then the action of the rule is not executed. Further, rules that descend from the rule in the hierarchy of rules are precluded from evaluation and execution. In one embodiment, modification of the hierarchy of rules may be performed without modification to an application using the hierarchy of rules.

Abstract: Techniques are provided for recovering from compilation errors in environments that use dynamic compilers. Application programs include Java bytecodes, and compilation includes sequential invocation of separate compilation phases on a region of bytecodes. If compilation of a region results in a fatal error, then the compiler identifies the “failed” phase. If the failed phase is a non-essential phase, then the compiler attempts to re-compile the region after skipping the failed phase. However, if the failed phase is essential, then the compiler attempts to replace that failed phase with a simpler version. Nevertheless, if the fatal error cannot be avoided or the compiler is unable to replace the failed phase with a simpler version, then the compiler prevents compilation of the code encompassing the fatal error in future attempts.

Abstract: The present invention includes a system and a method for updating components in a client computer. The invention includes a method for upgrading software for various users, each of the users having diverse hardware and software configurations. The invention includes a method for automatically determining the hardware and software configuration of the client computer without user intervention. To begin the upgrade, the client computer reads a configuration file that identifies the components for downloading. Upon receipt of the configuration file, the client computer determines the hardware and software configuration of the client computer. The client computer automatically communicates with a component server via a network and requests one or more components for downloading to the client computer based upon the configuration file and the hardware and software conditions of the client computer.

Abstract: Overall sequence of a system designed using an object-oriented language is analyzed so as to permit easy comprehension. Class name acquisition means of a sequence analysis apparatus acquires class names included in sequence diagrams. Instance name acquisition means acquires instance names included in the sequence diagrams, and method name acquisition means acquires method names included in the sequence diagrams. Call relationship acquisition means acquires call relationships of methods included in the sequence diagrams. Sequence table display means looks up the thus-acquired class names, instance names, method names and call relationships, to generate and display a sequence table showing a tabulated list of the call relationships of the method.

Abstract: The present invention provides methods specifically geared to finding natural splits in wide, nearly symmetric dependence graphs and assigning the components of the split to clusters in a VLIW processor. The basic approach of these methods is to assign a node n of the dependence graph to the cluster to which it has the strongest affinity. A node n has the strongest affinity to the cluster containing its closest common ancestor node. Then, the mirror image node or nodes of the node n are located if they are present in the graph and are assigned to other clusters in the processor to which they have the strongest affinity.

Abstract: A method and a system for scheduling a software pipelined loop with indirect loads. The system may include a data structure in communication with a processor and a memory. The processor may determine a condition associated with a potential for saturation of the data structure. Accordingly, the processor may provide a number of instructions associated with the software pipelined loop from the memory to a queue of the data structure prior to processing of the instructions by the processor based on the condition associated with a potential for saturation of the data structure.

Abstract: One embodiment of the present invention provides a system that facilitates interactions between different versions of software that support remote object invocations. During operation, the system receives a reference to an object that is implemented on a server. Next, the system identifies one or more versions of the object supported by the reference, wherein each successive version of the object inherits methods from a preceding version of the object. The system then invokes a method on the object that is supported by the one or more versions of the object.

Abstract: A program that includes expressions written in a process-based language for representing protocol-based applications as processes is disclosed. A process kernel executes the expressions in the program. The process kernel parses an expression to obtain syntactical elements that represent a queue, a set of queue delimiters, a query, a sequence delimiter, and other actions. The process kernel further translates the expression as a process whose first action is submitting the query as another process to the queue and after which the process continues with other actions. The query includes an organization scheme formed from a customizable, tag-based language that contains data and describes data.

Abstract: Executable software sent from an application service provider to a client computer can be arranged as a bundle of executable code blocks that are used during initialization of a group of applications (at least one initialization block from each application being included in the bundle). The bundle can include code for applications that are subscribed to by a user as well as for applications not subscribed to. As the subscribed applications are executed, usage data sent to a server may be monitored to determine unsubscribed applications that may be of interest to the user. Subscription offers may be automatically generated and sent to the user in response to processing of the usage data. Transmission efficiency of the code blocks may be improved by exchanging identification codes between the server and client to determine code blocks already present at the client.

Abstract: A method and system for verifying resolution of attributes of a computer program. The verification system analyzes a command-based computer program prior to runtime to determine whether the input attributes associated with a command would be properly resolved prior to execution of that command at runtime. During verification, the verification system processes the commands of the program in sequence. For each input attribute of a command, the verification system identifies a source (e.g., output attribute of a command) of the value for the input attributes. The verification system then determines whether that source would be properly resolved during execution of the computer program.

Abstract: An embodiment of the present invention is a consolidated package for diverse platforms to interoperate and transfer data. It allows otherwise incompatible systems to communicate with each other, exchange information, and otherwise interact. An embodiment of the present invention translates requests for information into a predetermined format that can be transmitted from a first platform to a second platform. One embodiment may transfer the information in an XML format over the Internet using HTTP or HTTPS. The receiving computer translates the XML stream into a properly formatted request and finds the requested information. The requested information is translated into an XML stream and transmitted over the Internet using HTTPS. The information is then translated into a format that the requesting computer can use. The system and method described herein can be used to exchange data between two computing systems.

Abstract: The present invention generally provides a method, apparatus, and article of manufacture whereby source code is analyzed by the compiler to determine if a default object capacity should change. In one embodiment of the invention, the compiler determines an initial object capacity based upon the use of a particular consumption method against an object created in the source code.

Abstract: Location types in unification-based, flow-insensitive “points-to” analyses represent three kinds of sets of abstract memory locations in a three-level subtyping system. The data constructor for “middle” and “upper” kinds of location types has a reader and a writer component. The “middle” kind of location types represent singleton sets of abstract locations. The reader and writer components of the “middle” type are both the same location type. The “upper” kind of location types represent complex sets of abstract locations. The reader and writer components of the “upper” type may be dissimilar location types. The reader components represent the set of values that may be read from memory via a pointer represented by the location type containing the reader component. The writer components represent the set of values that may be written to memory via a pointer represented by the location type containing the writer component.

Abstract: In a method of modeling a target system, a data structure is populated with points, where each point includes at least one target value associated with at least one system parameter value of the target system. The data structure is searched with at least one inquiry parameter value. A return value is interpolated for at least one inquiry parameter value based on the points.

Abstract: A method for post-link code optimization by identifying cold caller functions of a hot callee function, and percolating store and restore instructions with respect to non-volatile registers from the callee function to the caller function.

Abstract: A method and system are described for generating reference tables in object code which specify the addresses of branches, routines called, and data references used by routines in the code. In a suitably equipped processing system, the reference tables can be passed to a memory management processor which can open the appropriate memory pages to expedite the retrieval of data referenced in the execution pipeline. The disclosed method and system create such reference tables at the beginning of each routine so that the table can be passed to the memory management processor in a suitably equipped processor. Resulting object code also allows processors lacking a suitable memory management processor to skip the reference table, preserving upward compatibility.