Abstract: A state machine for an assembler capable of processing structured assembly language is disclosed. The state machine for an assembler capable of processing structured assembly language IF constructs includes five states, namely, an IF state, an ELSE state, an END—IF state, an ELSE—IF state, and a SETUP—IF state. In response to recognizing a SETUP—IF clause during the IF state or the ELSE—IF state, the process transitions to the SETUP—IF state. In response to recognizing an ELSE—IF clause during the SETUP—IF state, the process transitions to the ELSE—IF state.

Abstract: A method for gathering data from memory of a computer system is operable to gather scalar information, linked list information, or both. When gathering data from a linked list the method involves parsing a linked list to extract data therefrom by constructing a record list having a list memory element descriptor descriptive of the list head and data to be retrieved the list, following a list head locator of the list element descriptor to a head of the linked list, following links of the head and nodes of the list to a node of the linked list, interpreting a tag of the list element descriptor to locate data of the node, and extracting data from the node.

Abstract: A method and apparatus allow a programmer to repeatedly debug a program from the same starting point. The entire process state of the process can be saved at any time in the course of a debugging session to a disk file, called the checkpoint file. Now registers or memory may be modified, if necessary, and the program may be brought back to the same starting point where the state had been previously saved by resuming from the checkpoint file. The method and apparatus allow the state of all the programs to be saved multiple times and resumed from any one of those states. The debugging of a problem is considerably facilitated by not having to start from scratch to debug the problem as the last saved state of the program can be used to start the debugging.

Abstract: A method and a system are provided for efficiently executing computer programs that require invocation of an interpreter. A name of a program to be interpreted or executed is received, with zero or more arguments, at an interface client element. The interface client element may be implemented as a compact software element that is invoked using a command-line command. The interface client passes the program name and arguments to a server process that includes an interpreter. The server process provides the name and arguments to the interpreter. Interpretation results are received and passed back to the interface client. Efficient start-up is achieved for small, interpreted application programs for which start-up overhead exceeds the resources required to execute the programs. Embodiments are applicable to JAVA and to any computer programming language that can be used to write the server process, and that can dynamically instantiate and execute program code.

Abstract: This invention describes a method and several variants for compiling programs or components of programs in a mixed static and dynamic environment, so as to reduce the amount of time and memory spent in run-time compilation, or to exercise greater control over testing of the executable code for the program, or both. The invention involves generating persistent code images prior to program execution based on static compilation or dynamic compilation from a previous run, and then, adapting those images during program execution. We describe a method for generating auxiliary information in addition to the executable code that is recorded in the persistent code image. Further, we describe a method for checking the validity of those code images, adapting those images to the new execution context, and generating new executable code to respond to dynamic events, during program execution.

Abstract: A method for creating a computer program to be executed by a plurality of threads, in which the method utilizes a technique for execution synchronization referred to herein as a batch synchronization section. According to this technique, a plurality of threads may be associated with one another as a “batch” of threads. Each thread in the plurality (batch) of threads may execute the computer program simultaneously. The batch synchronization section may specify a portion of the computer program for which the execution of the portion by the plurality of threads is to be synchronized. In one embodiment different types of batch synchronization sections may be specified, wherein each type of batch synchronization section performs a different type of execution synchronization. In one embodiment the method may enable execution synchronization behavior for multiple concurrent executions of a test executive test sequence to be specified. The test sequence may include one or more batch synchronization sections.

Abstract: Automatic template instantiation for cross compilation is provided. More particularly, a routine (40) on a development computer system (10) extracts template information from source code (22). The routine (40) uses the template information to generate template source files (56, 56A, 56B), which may then be compiled with a cross compiler (20) to provide object code (54, 54A, 54B). Owing to one or more templates being dependent on one or more other templates, the routine is repeated until all templates, and their associated dependencies, are compiled into object code (54B) with the cross compiler (20). This object code is then portable from the development computer system (10) to a target computer system (60) for automatic template instantiation. Moreover, a template repository (52) is used to hold in part the template information. By centrally locating template information, duplicate templates may be avoided to conserve data resources.

Abstract: A method for converting interface definitions within a source code program into an intermediate format includes identifying with a computer system objects in a source code program and interfaces in the objects. Interface properties are determined including an internal interface for producing a link from an object with interfaces located outside the source code program, and an input and/or output interface. Links are identified including an internal link between an interface and an input interface between identified objects, and an external link of an external interface. An intermediate format table is created having rows in a dimension, second rows in another dimension, and cells disposed at intersections thereof. Designation are assigned for each identified object to rows in the first and for each identified link to rows in the second. Designations for associated interfaces are inserted in the cells.

Abstract: The present invention is a method and system to support debug. A function is re-compiled when a field watch for a field is activated. The function includes a byte code sequence having a field byte code that accesses or modifies the field. The re-compiled function provides a native code and occupies a code space. An instrumentation code corresponding to the field watch of the field is generated. The instrumentation code is inserted to the native code.

Abstract: A software system is provided to allow a computer to install and process web applications according to the invention. Such web applications are written as web pages that have access to the full range of operating system resources, including those not accessible through a web browser. Preferably, a web application is built using three types of languages used for constructing web pages, namely: (a) a visual presentation language; (2) a data modeling language; and (3) a scripting language for embedding logic. The software system preferably comprises a web application manager, an operating system interface module, a scripting language interpreter, and optionally a web browser and/or a data modeling language processor. Various other features such as data caching and security filtering are provided in accordance with such a system.

Abstract: The present invention is a method and system to support debug. A function is compiled. The function includes a byte code sequence having a field byte code that accesses or modifies a field. The compiled function provides a native code and occupies a code space. An instrumentation code corresponding to a field match of a field is generated. The instrumentation code is inserted to the native code.

Abstract: Computer readable media and methods are associated with a software development tool that is useful when authoring programs that generate documents, such as markup language documents. In one respect, the invention is a computer readable medium on which is embedded computer software. The software comprises a base class, an inline class and a container class. The base class defines a parent-child relationship by which a child object is stored within the storage space of its parent object. The inline class is an extension of the base class, wherein a member of the inline class is permitted to be a child object but prohibited from being a parent object. The container class is an extension of the base class, wherein a member of the container class is permitted to be a child object and/or a parent object. A well-formed document can be modeled in software using members of the inline and/or container classes.

Abstract: A method and system for generating a patch file from an old version of data which consists of a series of elements and a new version of data which also consists of a series of elements. Several patch files may then be aggregated into a secure, portable compressed archive to decrease the storage and transfer requirements of the patch file. The compressed archive uses an encryption process and may include an authentication process using digital signatures to secure the contents of the patch file from unauthorized access and to validate the identity of the creator of the archive. The archive is preferably in the format of a self-extracting .ZIP file, which file may include a rules-based form of intelligence to detect the presence of the appropriate files to be patched and to determine how the patching process should proceed.

Abstract: A method and corresponding apparatus for localization of a JAVA® application using a reflection API and a custom class loader use specifics of JAVA® language to provide localization of certain data elements, i.e., variables, of the application during class loading. The method and corresponding apparatus for localization reduce complexity of the JAVA® application by eliminating the function code dedicated to localization. In addition, the method and apparatus for localization increase productivity of engineers who write language-independent code, and reduce memory consumption of classes that use localized strings. Since all localization is accomplished when the class is loaded and since the code that uses localization is independent of the code performing localization, the method and apparatus for localization ensure better performance of the application and afford better code reusability.

Abstract: A method is disclosed for instructing a computing system to unwind a program call stack that lacks explicit Stack Frame Backchain Pointers, including finding the called function's entry point, determining the return point in the calling function, placing a NOP instruction at the return point that contains embedded information about what type of call was used, and backing up in storage by an amount determined by using the address of the called function's entry point to locate the static data item containing the called function's DSA size.

Abstract: A system for testing middleware of applications in the N-tiered model. The test system contains test code generators, test engines to execute multiple copies of the test code and a data analyzer to analyze and present the results to a human user. The system is able to automatically generate test code to exercise components of the middleware using information about these components that would otherwise be available to the application under test. Multiple copies of the test code are executed in a synchronized fashion. Execution times of multiple events are recorded and then presented in one of several formats. With the system, an application developer can identify components that represent performance bottlenecks or can gather information on deployment properties of individual components that can be used to enhance the performance of the application under test.

Abstract: Embodiments of the invention generally provide a method, article of manufacture, and apparatus for code transformation. In one embodiment, the invention provides a method of transforming source code. The method determines if a source code statement includes a first operation that receives input from a result of a second operation, where the second operation acts on a plurality of arguments. If the source code includes the first operation, then the method transforms the source code into a plurality of statements that include the first operation acting on one of the arguments.

Abstract: The present invention provides an active data type for use in a computer program. The active data type has an identifier and at least one algorithm associated therewith. The identifier is utilized by the computer program to identify the instance of the active data type. The algorithm is configured to be automatically executed when an attempt to access a value associated with the active data type instance is made by a routine or otherwise. When a particular routine that uses an instance of the active data type attempts to access the value associated with the active data type, the algorithm determines the value associated with the active data type before the routine obtains access to the value. The active data type may be a real, an integer, or a string, for example. The algorithm automatically determines the current value associated with the active data type instance. Preferably, the active data type has an identifier, a first algorithm and a second algorithm associated therewith.

Abstract: An applet latest version automatically setting system automatically sets the latest version of an applet such as a Java applet, etc. at a request of a client. Specifically, it stores in a method of an applet a program to update a version, realizes the update of the version of an applet in a process of the applet itself, and can necessarily use an applet of the latest version.

Abstract: A method for characterizing runtime behavior of a computer program executing in an execution environment comprising: generating a call stack runtime data structure for tracking methods currently active in an executing program thread, an active method on the call stack is represented by a frame; determining condition for sampling an executing program to determine current program behavior; and, upon determination of a sampling condition, the sampling including examining at least one frame in the call stack in response to evaluate context of one or more methods represented in the call stack, the at least one frame in the call stack providing context relating to an executing program's calling structure.