Abstract: Methods, computer program products, and system for generating code for an extract, transform, and load (ETL) data flow are provided. In one implementation, the method includes receiving an ETL data flow representing a logical transformation and flow of data, placing a staging table at a pre-determined location in the ETL data flow to reduce a total number of staging tables required by the transformation, and generating code for the transformation based on the ETL data flow including the staging table placed at the pre-determined location.

Abstract: Systems and methods for rebootless updating of a IHV display driver are disclosed. According to such a method, first, the operating system stops the driver from running. Second, the system switches over to an interim or temporary display driver, which be a default driver provided with the operating system. Third, the new hardware-specific driver is started. Thus, a hardware-specific display driver may be updated without rebooting.

Abstract: A method and apparatus for reducing a memory footprint of an embedded system. The method may include analyzing packages installed in a root file system of the embedded system, and determining which package components are not required for the operation of the embedded system. The method further includes reducing a memory footprint of the embedded system based on the above determination.

Abstract: A program execution device is provided which, even when a currently executed application (program) abnormally terminates, can prevent the application from becoming unusable, and thereby improve user convenience. An MA management unit includes: an MA management unit main for receiving an instruction from an initialization subprogram and controlling the other constituent elements in the MA management unit; an XAIT obtainment analysis unit for analyzing an XAIT sent from the head end; an MA selection unit A for selecting a program to be activated, according to the XAIT analysis result; an MA activation unit for activating of the specified program; an MA monitoring unit for monitoring the operational state of the specified program and notifying when an abnormal termination has occurred; and an MA selection unit B for selecting an alternative program.

Abstract: A method for automatic loading to a host of a functional unit driver stored as part of an executable program on a memory of a first functional unit, the method comprising physically connecting the first functional unit to the host and the first functional unit reporting itself to the host as being a generic storage device to make use of a generic mass storage class driver in the host. An operating system of the host reads an autorun file forming part of the executable program to load and execute on the host a driver set up program forming a part of the executable program. The host uses the driver set up program as executed on the host to install and execute the functional unit driver on the host.

Abstract: This disclosure provides various embodiments of software for implementing a safe framework for application development. In one aspect, the software initializes an application using a runtime framework, identifies a customized class residing in a library associated with and decoupled from the runtime framework, identifies a path to the customized class residing in the library, and automatically loads the class to run the application. In some implementations, the customized class may comprise a distinct version of a standard class from the standard library. In still other implementations, the software may selectively identify a customized class or a standard class, identify a path to the selectively identified class, and automatically load the selectively identified class.

Abstract: Precise exception handling relies on a precise subject state including an accurate program counter and register values of a subject processor. Subject code (17) is translated into target code (21) executable by a target processor (13). The generated target code (17) includes counterpart target instructions (214) associated with fault-vulnerable subject code instructions (174). Further, each of the counterpart target code instruction (214) is associated with recovery information (195). When an exception (e.g. a fault) occurs, the recovery information (195) is retrieved and used to recover a precise subject state, in particular by taking account of optimizations to generate the common-case target code (21). The precise subject state is then used to precisely handle the exception.

Abstract: Described herein is an implementation of a technology for the construction, identity, and/or optimization of operating-system processes. At least one implementation, described herein, constructs an operating-system process having the contents as defined by a process manifest. Once constructed, the operating-system process is unalterable.

Abstract: A method and apparatus for remote installation of network drivers and software. The present invention provides for the remote installation of a rerouting driver into the network driver interface in the path between one or more media access control units and one or more protocol drivers in a computer system. Code in the network driver interface is disabled, patched to insert the rerouting driver, and then re-enabled. The disabling and re-enabling of the code is performed such that the computer system does not have to be restarted following installation of the patch.

Abstract: The present relates to a method for verifying privileged and subject-executed code within a program, the method further comprising the steps of constructing a static model of a program, identifying checkPermission nodes that are comprised within the invocation graph, and performing a fixed-point iteration, wherein each determined permission set is propagated backwards across the nodes of the static model until a privilege-asserting code node is reached. The method further comprises the steps of associating each node of the invocation graph with a set of Permission allocation sites, analyzing each identified privilege-asserting code node and subject-executing code node to determine the Permission allocation site set that is associated with each privilege-asserting code node and subject-executing code node, and determining the cardinality of a Permission allocation-site set that is associated with each privilege-asserting code node and subject-executing code node.

Abstract: A method and system for the automatic generation of instruction-set manuals. Specifically, the method of the present invention includes accessing an abstract processor model of a processor, wherein said abstract processor model is represented using a hierarchical architecture description language (ADL). The abstract processor model includes a plurality of instructions arranged in a hierarchical structure. An internal representation of the abstract processor model is generated by flattening the abstract processor model. The flattening process generates a plurality of rules grouped by common convergent instructions. Each rule describes an instruction path through the hierarchical structure that converges at a corresponding convergent instruction. An instruction-set documentation is automatically generated from the plurality of rules, wherein the instruction-set documentation is arranged convergent instruction by convergent instruction.

Abstract: A test harness system and method of functionality testing of wireless component applications is provided. The test harness system comprises at least one testlet for testing at least one target application log event and at least one event handler for validating at least one comparator against the at least one target application log event. The method comprises the steps of listening for target application log events, receiving a target application log event, receiving a testlet and validating the target application log event based upon the testlet.

Abstract: A method of instrumenting one or more units of an application program is disclosed. Each unit can have one or more interfaces through which communications pass through the unit. Client units can request creation of a server unit. When they do so, the call is intercepted and sent to a unit creation function, which creates the server unit and returns a reference to an interface of the server unit. When a reference to an interface of the server unit is detected, an interface wrapper is created for the interface, the interface wrapper comprising a reference to instrumentation, the reference to the interface, and a reference to a type description of the interface. The client receives a reference to the interface wrapper in place of a reference to the interface, and thereafter is able to treat the reference to the interface wrapper as if it were a reference to the interface.

Abstract: Systems, methods and apparatus are provided through which, in some embodiments, a formal specification is pattern-matched from scenarios, the formal specification is analyzed, and flaws in the formal specification are corrected. The systems, methods and apparatus may include pattern-matching an equivalent formal model from an informal specification. Such a model can be analyzed for contradictions, conflicts, use of resources before the resources are available, competition for resources, and so forth. From such a formal model, an implementation can be automatically generated in a variety of notations. The approach can improve the resulting implementation, which, in some embodiments, is provably equivalent to the procedures described at the outset, which in turn can improve confidence that the system reflects the requirements, and in turn reduces system development time and reduces the amount of testing required of a new system.

Abstract: A method and implementing computer system are provided in which selected information is embedded within computer program structures without requiring separate bit strings. In an exemplary embodiment, the embedded selected information includes an identification of a licensed user together with a serial number of the associated licensed program. That information is converted into a binary representation, and a transfer function is used to embed the binary representation into the structure of the licensed program. In the example, when a licensed program is compiled, linked and downloaded over an interconnection network, the order or sequence of the modules of the licensed program is arranged in a manner to correspond to the embedded selected information. The embedded information can then be extracted from the program by analysis of the organization of the modules comprising the program.

Abstract: Project information relating to a project is received, the project information identifying a project type, an authorized write entity, and an authorized approval entity, and a valid metric is selected based at least on the project type, the valid metric measuring an aspect of performance of the project. Base measures corresponding to the valid metric are received from the authorized write entity, the base measures further including periodic base measures corresponding to at least one metric period, and aperiodic base measures corresponding to an aperiodic incident, and the valid metric is calculated based on the base measures. The base measures are sorted into excluded base measures and non-excluded base measures, organizational baseline data is imported, and an organizational indicator is calculated based on the non-excluded base measures and the organizational baseline data.

Abstract: A method and apparatus are described for providing an undoable programming language. More specifically, the present invention relates to providing a fully undoable programming language, where the language includes a fully undoable core language portion and a conventional language portion. An embodiment of the present invention includes a method of determining an actual target of an event calculating a set of pre-events of the event, adding the set of pre-events as children of the event, and the set of pre-events being set to be raised to a pre-queue of the event. The method also includes applying an event principle to each pre-event of the event such that a set of protected positions being augmented with an upward closure of the target, executing the event, if the actual target is defined and the event is consumable, and applying the event principle to each post-event of the event.

Abstract: The present invention provides a method and system for optimization of an intermediate representation in a graphical modeling environment. A first intermediate representation is provided. At least one optimization technique is applied to the first intermediate representation. A second intermediate representation is generated responsive to the application of the at least one optimization technique to the first intermediate representation.

Abstract: Embodiments of the present invention provide a method, system and computer program product for a distributed resource understanding tool. In one embodiment of the invention, a distributed resources understanding tool data processing system can include an IDE configured for operation in a local development platform coupled to a remote host, a local implementation of a resource understanding tool coupled to the IDE, a remote implementation of the resource understanding tool associated with the remote host, and resource understanding tool synchronization logic. The logic can include program code enabled to invoke the local implementation of the resource understanding tool, further invoke the remote implementation of the resource understanding tool, combine results sets produced by each of the local and remote implementations of the resource understanding tool to produce a composite results set, and render the composite results set in the IDE.

Abstract: A computer-implemented method, computer program product and data processing system to improve runtime performance of executable program code when executed on the data-processing system. During execution, data is collected and analyzed to identify runtime behavior of the program code. Heuristic models are applied to select region(s) of the program code where application of a performance improvement algorithm is expected to improve runtime performance. Each selected region is recompiled using selected performance improvement algorithm(s) for that region to generate corresponding recompiled region(s), and the program code is modified to replace invocations of each selected region with invocations of the corresponding recompiled region. Alternatively or additionally, the program code may be recompiled to be adapted to characteristics of the execution environment of the data processing system.