Abstract: A method and system for providing a block for use in a block diagram in a graphical modeling environment which is capable of outputting information regarding the dynamic state of the block.

Abstract: An object ordering tool analyzes output from a linker to determine ordering of code objects in first and second firmware binary images. The tool produces a linker script file used by the linker to link the code objects of the second firmware binary image in a more optimal order for production of updating information used in the electronic device for updating firmware of the electronic device.

Abstract: A method and system for transforming information between data formats.

Abstract: Methods and systems for debugging add-ins using a non-destructive approach. Add-ins are hosted, not stand-alone components, that run in a host application. The add-ins are loaded into an isolated environment so they can be debugged and stopped without affecting the host application. This prevents termination of the host application at arbitrary times. In addition, the host application can refresh itself when an add-in is stepped through in the debugger. The present invention also allows the add-in developer to interact with the host application during a debugging session even when the add-in is stopped at a breakpoint.

Abstract: A computer program implemented method controls interruption of execution of tasks running in a multi-processing computer system to permit user intervention. The system includes a repository of data identifying preselected tasks for interruption and identifying the user defined circumstances for such interruption. It also has a plurality of task caches for storing subsets of the repository data for respective tasks. According to the method, the repository is scanned during an initiation phase of any task for data relevant to the task. Any such relevant data is stored in the respective task cache. The task is then executed and if a defined circumstance for the task arises by reference to the task cache, the task is interrupted to enable user intervention. This can include updating the repository to redefine the circumstances for interruption. Execution is then resumed and the respective task cache refreshed with any relevant repository updates.

Abstract: Methods, systems, and articles of manufacture for allowing an update to an executable component, such as a logical partitioning operating system, running on a computer system without requiring a reboot (or IPL) of the computer system are provided. Processors or tasks executing in a portion of code being updated may be forced to a known or “quiesced” state (e.g., designated wait points) before applying the update. If any of the processors or tasks are not in their quiesced state, the update is not applied or may be rescheduled for a later time, in an effort to allow the system to reach the quiesced state.

Abstract: The concept of “renderers” and “translators” is introduced in connection with bidirectional conversion between object models and XML. A renderer embodies the logic responsible for mediating the parser specific APIs for reading and writing XML. It utilizes a plurality of translator objects, which embody the mapping information needed to convert the XML into object model instances. The translator objects themselves do not contain “knowledge” of parser implementations; thus, the translators are common and can be shared and reused by any and all renderer implementations. Since each translator embodies the knowledge and rules regarding how to convert an XML model to an object model, and how to convert object models to XML, it is thus independent of the particular renderer that is being used, whether it be SAX, DOM, or some other renderer.

Abstract: Methods and apparatus are provided for supporting text-based context links for application programs. In some embodiments, an application executing on a first computer system may receive a request to open a context link to a text element in a document. The application may determine, based on a list of context links, whether more than one data object is associated with the text element. If so, a list of data objects associated with the text element and distinguishing information may be displayed, a selection of a data object from the displayed list may be received, and a selection of an action relating to a context link for the selected data object may be received. In some embodiments, the context link list is created by parsing a document into text elements at the first computer, storing entries representing a plurality of text elements on a list, and transmitting the list to a second computer to determine in the second computer if the text elements are associated with data objects.

Abstract: Methods and systems are provided for analyzing a source code. The method includes collecting function entry information during the execution of tests on the source codes. The function entry information is then converted into symbolic codes. The function calls are replaced by the elements of the symbolic codes in the source codes. The elements can be in the form of functions. Subsequently, static analysis is performed on the source code by using the mapping between the function calls and the functions in the source code.

Abstract: A system and method for collecting a plurality of metrics during a single run of a computer program. The mechanism of the present invention initializes a plurality of counters to count events associated with metrics of interest. The mechanism of the present invention then counts the occurrence of events associated with metrics of interest during a single execution of a computer program. When a branch has been taken, a trace record is generated for the branch taken, wherein the generated trace record contains a count of events associated with the metrics of interest for the branch taken.

Abstract: A method and device for translating a program to a system including at least one first processor and a reconfigurable unit. Code portions of the program which are suitable for the reconfigurable unit are determined. The remaining code of the program is extracted and/or separated for processing by the first processor.

Abstract: A computer system includes a processing unit that processes data in response to instructions read from memory. Before being ready for a user to make use of a loaded application, the system initially loads executable instructions from permanent storage (such as a magnetic disc drive) during a loading process. In order to make better use of this time, operation related data (that is data for assisting a user to operate the system) is displayed during the loading process. The operation related data is stored in a user accessible file. Furthermore, the application itself facilitates the user re-configuration of the user accessible file under the control of the processing unit when the processing unit is executing the instructions; it not being necessary to use a third party text editor and navigate through the file structure. Then, during a subsequent instruction loading process, the user re-configured data is read.

Abstract: The present invention provides a method, apparatus and computer program product for combining a plurality of run units into a single executable file. According the invention each run unit may contain one or more data entities which are designated as being required only once in an executable file. As a result when the executable file is built, if a run unit with a data entity of a given value is to be added to an executable file, if a previous run unit with a data entity with a matching value has previously been added to the executable file, the run unit is added to the executable file but without the data entity.

Abstract: A system and method are provided for a query language mapping architecture. In an embodiment, the query language mapping architecture includes an Enterprise Java Bean (EJB) interpreting layer to receive one or more EJB persistence requests and to translate the one or more EJB persistence requests to command sequences. In an embodiment, the query language mapping architecture may also include a Structured Query Language (SQL) assembly layer to receive the command sequences from the EJB interpreting layer and to assemble one or more SQL statements based, at least in part, on the command sequences.

Abstract: A method for tracking a target object, involving identifying at least one portion of code corresponding to a constructor for the target object, and inserting a first tracking method before the at least one portion of code and inserting a second tracking method after the at least one portion of code to obtain executable code, wherein the first tracking method and the second tracking method comprise a calling object reference and a target object reference as arguments.

Abstract: An apparatus in one example comprises a manager component for a distributed software application that based on one or more of a characteristic of an executable of the distributed software application and/or a characteristic of one or more of a plurality of processors, selects a processor from the plurality of processors to run the executable upon startup of the distributed software application.

Abstract: A finalizer may include a notification that no tolerance for failure or corruption is expected. Any potential failure point, which may be induced by a runtime execution environment routine or subroutine that is associated with the finalizer may then be prepared apart from the finalizer.

Abstract: Managing a computer system having a plurality of blades by detecting the presence of a new blade in the computer system; installing an operating system on the new blade; configuring the operation system; and copying a service that is running on an earlier detected blade to the new blade. Further features are testing services and operating system on the new blade and cyclically shifting services through the blades.

Abstract: A class loader locates, at run time, a requested code component. The code component is preferably stored on a database, rather than in a file system, to improve its accessibility in a network computing environment. Code components are preferably stored in the database using an organizational structure that reflects a code isolation structure. In this manner, different versions of a particular code component can be retrieved in a transparent, automated manner, depending on information associated with the invocation thereof.

Abstract: Techniques and tools for achieving improved test coverage in a finite program state space are described, such as a technique for selecting a set of predicates, calculating a set of possible predicate values, calculating a subset of the set of possible predicate values, and generating a test for the computer program based at least in part on the subset. The subset comprises an approximation (e.g., an under-approximation) of reachable states in the program. A superset of the set of possible predicate values also can be calculated; the superset comprises an over-approximation of the reachable states in the program. In another aspect, a Boolean abstraction of a program is generated, reachability analysis is performed based at least in part on the Boolean abstraction, and symbolic execution is performed to generate test data. The reachability analysis can include computing lower and/or upper bounds of reachable observable states.