Abstract: A method and system are provided for detecting invalid function calls between segments during the generation of a computer program. A source file and a fixup source file are created for a program file. The source file defines segments in the program file. The fixup source file defines the segments defined in the source file to be a predetermined size. Next, the program file, the source file, and the fixup source file are assembled to create a program object, a source object, and a fixup object. A source library and a fixup library are created from the source object and the fixup object. The program object is linked with the fixup library to generate a dummy output file. During the generation of the dummy output file, a determination is made as to whether an invalid function call is made between the plurality of segments defined in the fixup library. If it is determined that an invalid function call is made between the segments defined in the fixup library, then an error is reported in the dummy output file.

Abstract: An apparatus, program product and method utilize an inheritance breakpoint to assist in debugging an object-oriented computer program having a method identified in a base class or interface and implemented by at least one method implementation in another class. Creation of an inheritance breakpoint for a particular method responsive to a user request typically results in the automated generation of a breakpoint for all or a subset of the implementations of that method, often freeing a user from having to manually determine what particular implementation(s) implement that method. In many environments, the automated generation of implementation breakpoints may be performed during initial loading of classes within which such implementations may be defined.

Abstract: An infrastructure for handling the administration of possible and mandatory input arguments at runtime for software program code. A user alterable argument descriptor file (ADF) stores all information related to input and output arguments for a software program and its constituent subpieces. During invocation of a software program, all command line flags and values are validated against the ADF, and valid pairs are stored in a key/value dictionary which is passed to the software program. Each subpiece of the software program may then access its needed arguments from the dictionary independently of other subpieces, thereby allowing modifications to subpieces which require new or changed arguments without the need to recompile the entire software program.

Abstract: A method is disclosed for partitioning a managed state for a Java based application. The application developer is allowed to associate individual entity beans with a particular state management type. Then, during execution, a plurality of state objects are provided, where each state object stores a state of a corresponding entity bean object within the memory address space of a Java server process. Further, each state object is associated with the state management type of the corresponding entity bean object. In this manner, state management is provided for each entity bean object based on the associated state management type using a corresponding state object. The state management type can be a memory replicated state management type, a disk replicated state management type, a non-replicated state manage type.

Abstract: A method and apparatus for updating inter-server communication software in a network are provided. More particularly, the invention is directed to a technique for software updating of servers that reduces the unavailability of network resources due to the update process. In this regard, the method includes the implementation of proxy software in servers that are to be updated. The servers are then selectively updated (e.g. one server at a time) in a manner, using the proxy software, to allow the servers to communicate with one another during the entire update process.

Abstract: A method and system for organizing nodes within a program tree. The system allows various child node categories to be defined for node types of a program tree. When a child node is added to a parent node, the system identifies the category of the child node. The system then instantiates a category data structure for the identified category. The system stores a reference to the instantiated category data structure in the parent node and stores a reference to the child node in the instantiated category data structure.

Abstract: A system and method for program counter and data tracing is disclosed. The tracing mechanism of the present invention enables increased visibility into the hardware and software state of the processor core.

Abstract: A program and method enables easy creation and manipulation of timing charts. The preferred embodiment employs off-the-shelf commercial software and uses Visual Basic commands to get timing chart drawing commands into the drawing program and out of the spreadsheet program to order the drawing program to produce a displayable and print/plotable file. The user can easily see changes needed and even if they require ripple-through redrawing, because the user manipulates data in the spreadsheet file instead of directly manipulating drawing commands, the spread sheet will carry through ripple-through calculations to modify all lines related to the recalculated data.

Abstract: Methods, systems, and computer program products for programmatically enforcing referential integrity constraints defined for classes of an arbitrary modeling framework (such as the Meta Object Facility, or “MOF”) when associations among class instances are modified. The present invention relieves the application programmer of the burden of writing code to maintain the links between instances, and applications are therefore considerably easier to write and to maintain, and programmatically maintains inverse links. This reduces the amount of data to be serialized, as the other link can be automatically resolved at the time the inverse link is reconstituted, and also helps in maintaining referential integrity among serialized instances (e.g. where associations are specified in one or more XML Metadata Interchange, or “XML”, documents) because redundant information about the values of the same association will not have to be written across different documents or storage repositories.