Abstract: An illustrative embodiment of a computer-implemented process for selective delta validation of a shared artifact receives a notification associated with a shared artifact, determines whether a unique key exists for the shared artifact in a symbol data structure, and responsive to a determination that the unique key exists, determines whether an update from an external source occurred. Responsive to a determination that the update occurred from an external source, receives a timestamp associated with the unique key from the symbol data structure to form a received timestamp, determines whether the received timestamp is prior to a last modification time, and responsive to a determination that the received timestamp is prior to the last modification time, performs a delta validation of the shared artifact.

Abstract: The present invention provides a process for generating a shared function binding arrangement comprising a first module and a shared module which includes a plurality of functions and having means for binding a function shared between the first module and the shared module. The process comprises a linking phase for creating the first module and the shared module, a preparation phase for preparing the first module for calling the shared module without exposing details of the call, and a loading phase for loading the modules and linking the first module to a respective function in the shared module without exposing details of the call. The invention also provides a method and system for binding a function shared between a first module and a shared module by means of a linking arrangement a linking arrangement that enables the first module to call a respective function in the shared module without exposing details of the call.

Abstract: An approach is provided in preparing a dynamically loaded kernel extension. The approach includes compiling a kernel extension program that includes a symbol, such as a function. The symbol is exported from the kernel extension program and a symbol broker that references the exported symbol is compiled. A kernel extension loader library is created with a defined callable symbol that corresponds to the exported symbol. The kernel extension loader library is linked by an external program after compilation of the external program resulting in a compiled external program. The kernel extension loader library dynamically loads the compiled kernel extension program, the compiled symbol broker, and the exported symbol when the defined callable symbol is referenced by during execution of the compiled external program.

Abstract: Duplicative code found in modules of high level computer code can be eliminated at link-time. A compiler forms a plurality of object files from a software program in which each object file includes one or more functions associated with the software program. An analyzer examines each function to ascertain whether any of the plurality of object files include functional duplicates. In addition, call and caller routing references are determined for each of the object files and functions contained therein. Responsive to determining that a functional equivalence exists, the routing of duplicative functions is altered to reference a golden copy of the same function. Once the call and caller information has been re-routed, the duplicative function(s) is(are) deleted.

Abstract: A method and apparatus for providing support for customization of a build configuration of a Unified Extensible Firmware Interface (UEFI) compatible component. The method includes modifying the build configuration of the UEFI compatible component to reflect modifications to a first file. A configuration parameter is received. The configuration parameter is used to create a configuration parameter symbol pointing to the first file. The first file is replaced with a second file, which includes modifications to the first file. The modifications support a functionality desired by a user.

Abstract: Methods, apparatuses and program products are disclosed for dynamic link loading in extensible firmware interface compliant systems. Provision is made for loading a microkernel (or other kernel program) which presents itself as though it were a DXE Driver and hooks and redirects a loadmodule service of a DXE Foundation core program to a DLL aware loader. Further aspects of the invention provide related, analogous and similar capabilities.

Abstract: A method of producing an executable image from an object file without shared library support from the operating system, wherein the executable image requires a shared library file in order to resolve at least one of the symbols called for in the object file. A method of optimizing the loading of a previously linked file into working memory in a computer for executing in a single address space of the working memory, the file containing an instruction to make an indirect jump to a location in a shared library through an import section of the file. A method for optimizing the loading of a previously linked file into working memory in a computer for executing in a single address space of the working memory, the file containing plural sections with number-filled padding between the end of each section and a succeeding page boundary. A method of optimizing the loading of a previously linked file into working memory in a computer for executing in a memory sharable with other executables.

Abstract: A system and method for managing data, such as in a data warehousing, analysis, or similar applications, where dataflow graphs are expressed as reusable map components, at least some of which are selected from a library of components, and map components are assembled to create an integrated dataflow application. Composite map components encapsulate a dataflow pattern using other maps as subcomponents. Ports are used as link points to assemble map components and are hierarchical and composite allowing ports to contain other ports. The dataflow application may be executed in a parallel processing environment by recognizing the linked data processes within the map components and assigning threads to the linked data processes.

Abstract: Computer implemented method, system and computer usable program code for sharing resources among a plurality of containers in a data processing system. A computer implemented method includes creating a shared container for at least one resource to be shared. Then the at least one resource to be shared is moved from an original container of the at least one resource to the shared container, and a link is created between the original container and the at least one resource to be shared in the shared resource container. A link can also be created between a subject resource container and a shared resource in the shared resource container to enable the subject resource container to access and use the shared resource. A shared resource can also be removed from the shared resource container and returned to an original resource container when sharing of the resource is no longer desired.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for captive runtime deployment. In one aspect, a method performed by data processing apparatus employing a runtime environment includes accessing software code of a software application that relies on a runtime of the runtime environment to operate; selecting a proper subset of the runtime, including sharable library code, based on information associated with the software application; combining the software code and the proper subset of the runtime to form a computer program configured to effect the software application using a version of the runtime captive to the computer program, the captive version of the runtime including the proper subset of the runtime; and storing the computer program on a computer-readable medium coupled with a processor.

Abstract: A server receives an application update request from a mobile device. The request can include a specification of the mobile device and a license. The server can identify an available hardware component of the mobile device based on the specification. The server can identify an access privilege of the hardware component based on the license. The server can further identify an application that utilizes the available hardware component of the mobile device and is accessible under the identified access privilege. The server can recommend the application in response to the application update request.

Abstract: A method of producing an executable image from an object file without shared library support from the operating system, wherein the executable image requires a shared library file in order to resolve at least one of the symbols called for in the object file. A method of optimizing the loading of a previously linked file into working memory in a computer for executing in a single address space of the working memory, the file containing an instruction to make an indirect jump to a location in a shared library through an import section of the file. A method for optimizing the loading of a previously linked file into working memory in a computer for executing in a single address space of the working memory, the file containing plural sections with number-filled padding between the end of each section and a succeeding page boundary. A method of optimizing the loading of a previously linked file into working memory in a computer for executing in a memory sharable with other executables.

Abstract: The embodiments described herein generally relate to a method and system of injecting repeatable processes, or workflows, into the processing of data-oriented or procedural requests in an entity management system. A request in such a system is subject to authentication, authorization, and action phases of processing, and workflows may be associated with each phase for automatic processing upon the triggering of a certain request under particular circumstances. A declarative mapping associates workflows with the request type, phase, requester, and target. The mapping may be created at the system administrator level, or by any person with the necessary capabilities, through the application of the processing concept in API or UI and may be consulted and invoked upon receipt of a request matching the mapping's criteria. Mappings may also be created and retrieved to manage state changes resulting from processing in other phases of the request processing model.

Abstract: Described herein are methods for sharing resource dependencies between applications stored on a system. For example, in at least certain embodiments, a computer-implemented method for sharing resource dependencies includes installing or initiating installation of multiple application bundles having one or more applications and respective resources on the system. Next, an installer determines identifiers (e.g., hash signatures) for first and second resources and determines whether the resources are identical if an identifier for the first resource matches an identifier for the second resource. Then, a link is created from the second application bundle to the first resource of the first application bundle if the first resource is identical to the second resource. The second resource may be removed from the system if it has been installed. Alternatively, installation of the second resource is terminated if it has not been installed on the system.

Abstract: The present invention is generally directed to a method, system, and article of manufacture that ensures the integrity of programs having variable portions. One aspect of this invention is a method for protecting software products having variant portions. This method includes identifying a reference to an external target in a software product, creating an identifier for the external target, and adding the identifier to the reference. In some embodiments, the unique identifier is a digital signature and the reference to an external target is a call to an external library.

Abstract: A computer implemented method, apparatus, and computer program product for dynamically loading a module into an application address space. In response to receiving a checkpoint signal by a plurality of threads associated with an application running in a software partition, the plurality of threads rendezvous to a point outside an application text associated with the application. Rendezvousing the plurality of threads suspends execution of application text by the plurality of threads. The application text is moved out of an application address space for the application to form an available application address space. The available application address space is an address space that was occupied by the application text. A software module is moved into the available application address space.

Abstract: A method and system to automatically translate a definition of a choreography workflow process to an executable process are provided. The method includes processing a collaboration element from the definition, mapping the collaboration element to an executable element based on a knowledge database system that contains the collaboration element and the corresponding executable element and mapping the collaboration element to the executable element statically if the corresponding executable element is unavailable in the knowledge database system.

Abstract: The illustrative embodiments described herein provide a computer-implemented method, apparatus, and computer-usable program code for accessing a compatible library. The process receives a file name associated with a library reference. The library reference is included in an executable, and indicates a library used for executing the executable. The process receives environmental variable information in response to identifying an unavailable library in a secondary memory. The unavailable library is associated with the file name. The process accesses the compatible library from a shared library segment using the file name in response to receiving the environmental variable information. The compatible library is associated with the file name. The process utilizes the compatible library to execute the executable.

Abstract: A computer implemented method of computer implemented method for installing a code object in a user process virtual memory space, while the user process is running is provided. The user process is run in a virtual memory space. A controller process is run in a different virtual memory space than the user process. The control process requests to a kernel module to install the code object into the virtual memory space of the user process. The kernel module installs the code object into the virtual memory space of the user process, while the user process is running.

Abstract: A system, such as a database system, includes a shared library having plural routines. A linking procedure is used in which a routine (referred to as a “first routine”) is linked to a stub library containing stub programs corresponding to other routines that the first routine is authorized to invoke. If no linking error occurs, the first routine is then linked to the shared library. In some implementations, the first routine is one of a user-defined method (UDM), user-defined function (UDF), or stored procedure created in response to a database query language (e.g., Structured Query Language or SQL) statement.

Abstract: Embodiments of the present invention provide a method, system and computer program product for the heuristic malware detection. In one embodiment of the invention, a heuristic malware detection method can include merging a baseline inventory of file attributes for respective files from each client computing system in a community of client computing systems into a merged inventory. The method further can include receiving an updated inventory of file attributes in a current inventory survey from different ones of the client computing systems. Each received survey can be compared to the merged inventory, and in response to the comparison, a deviant pattern of file attribute changes can be detected in at least one survey for a corresponding client computing system. Thereafter, the deviant pattern can be classified as one of a benign event or a malware attack. Finally, malware removal can be requested in the corresponding client computing system if the deviant pattern is classified as a malware attack.

Abstract: The functionality of a core application is extended using an add-on application (module) by extending native data types on the core application with custom data types and custom actions on the module. The module provides metadata associated with its custom data types and custom actions to the core application, which creates a dynamic type/action table. In some cases, native data types may be extended with custom data types and their associated actions. In other cases, native data types may be extended with custom actions from the module. The custom actions may be enabled for instances of native data types that have been extended. When a custom action is selected, code corresponding with the selected custom action is called from the module and run to perform the selected custom action.

Abstract: Described are techniques and mechanisms for enforcing trust between an application and a library loaded by the application. Very generally stated, the application declares one or more trusted code groups (“TCGs”) of which a library must be a member to be authorized for execution with the application. Libraries that are authorized to assert membership in one or more TCGs include a secure indicator of that membership. As the application executes and attempts to load a library, that libraries membership in a TCG authorized by the application is verified prior to loading the library.

Abstract: Methods, apparatuses, and systems for managing a network with a non-system class loader via remote method invocation are described. A method includes transferring the Java remote method invocation (RMI) call to a network element in order to obtain a version of the management software associated with the network element. The method further includes determining if a requested class to be loaded by a class loader based on the RMI call belongs to a system namespace or a non-system namespace. The method further includes obtaining a byte code associated with the requested class from a class hash with a class name key if the requested class belongs to the non-system namespace. The method further includes loading the requested class and associated byte code to a Java virtual machine with a non-system class loader if the requested class belongs to the non-system namespace.

Abstract: The operating system manages software entities by creating a construct called a context that organizes and manages software-related state and configuration settings of applications. A context may comprise an installation service, a configuration service and an activation service. Contexts can be linked or arranged hierarchically to form parent-child relationships. Hierarchies may be used to affect accessibility of software items, to satisfy dependencies, to control the visibility/invisibility of software items, to provide access to configuration settings and to override software availability, dependencies and configuration settings. An override may be applied to set policy when more than one context has a configuration setting, dependency or access to a software entity.

Abstract: A method, system, architecture and apparatus for generating a shared library for a pervasive device target platform which can accommodate relocatable data. A tool chain in furtherance of this purpose can be arranged in accordance with the present invention to include a compiler programmed to compile source code into a compiled object and a linker programmed to link the compiled object into a linked object using a relocatable data segment. In this regard, in a preferred aspect of the invention a linker configuration file can be included for use in the linker which specifies the use of the relocatable data segment in lieu of a position independent data segment. The tool chain further can be arranged to include a relocation data extraction tool programmed to extract relocation data from the linked object and to dispose the relocation data in a relocation data file configured for disposition in a pervasive device.

Abstract: A system 300 and method for fast matching of JAVA classpaths in a shared classes JVM system by identifying classpaths of loaded classes and storing a local array (110, 210) of identified classpaths in order to avoid checking on a subsequent class load for a particular JVM. This allows dramatic speeding up of class-loading in cases where multiple JVMs are running similar applications.

Abstract: A program which is linked or bound by reference (referenced program) into one or more other programs supports multiple valid export signatures, each corresponding to a respective version of the referenced program. When a program is built, it records the current signature of each referenced program it is bound to. When subsequently determining whether to rebuild the program, the previously recorded signature of any referenced program is compared with all currently supported signatures of the referenced program, and only if none of the supported signatures matches does the program need to be re-built to ensure compatibility with the referenced program. Preferably, the referenced program is a program library containing supporting procedures, intended to be used by multiple applications programs which are bound to it.

Abstract: A resources sharing container having logic-linking mechanism for logically linking program code to pages, pages to applications and applications to solutions. The resources sharing container will have the ability to create finished solutions by using its logic functionalities (logic-linking, resources code, enhancements, etc.), application requirements (application pages and their programming code logic) and preconfigured enhancements (settings, translations, interfacing, securities, etc.), and have the final solution tailored to each user's prerequisites. Moreover, it will permit the creation of a global resource sharing of logically linked software code blocks, application pages and application page's settings that can be shared in house, over a network or globally over the Internet, thus, reducing replication and distribution costs, since all the developments, securities and enhancements are at the resources level at a single location.

Abstract: A method, system and program storage device for preventing a real-time application from running out of free threads when the real-time application receives a device interface request. A set of special data packets for the main user application is provided. Shared functions are provided as part of the device interface to indicate the error condition when there is no more free thread and for a utility program to recognize a retry is needed. Thus, the retry mechanism is embedded in the shared functions running on both the main user application and all utility programs.

Abstract: A method for creating a reusable library, including providing one or more functions, providing a function table for the provided one or more functions, and providing a configuration structure for communicating values between the provided one or more functions and a program that calls the reusable library. The program that calls the reusable library communicates a function table structure to the reusable library containing information as to which of the one or more functions are desirable. When those of the one or more functions that are not desirable contain dependencies, those dependencies are canceled.

Abstract: A method for sharing static link codes by software components in a dynamic link library (DLL) and a main program. First, the main program links to a static link library (SLL) and creates function pointers and variable pointers in the DLLs corresponding to the SLL. Next, the functions of a DLL program code associated with calling the SLL are changed into corresponding function pointers. Next, the variables of the DLL program code associated with calling the SLL are changed into corresponding variable pointers. Finally, the main program and the DLLs are compiled into the respective program codes, wherein the functions and variables associated with a DLL are obtained via the pointers. When the DLL is loaded in the main program, the memory addresses of the functions and variables for calling and corresponding to the SLL are passed to the DLL to share the static link codes with the main program.

Abstract: Computer implemented method, system and computer usable program code for sharing resources among a plurality of containers in a data processing system. A computer implemented method includes creating a shared container for at least one resource to be shared. Then the at least one resource to be shared is moved from an original container of the at least one resource to the shared container, and a link is created between the original container and the at least one resource to be shared in the shared resource container. A link can also be created between a subject resource container and a shared resource in the shared resource container to enable the subject resource container to access and use the shared resource. A shared resource can also be removed from the shared resource container and returned to an original resource container when sharing of the resource is no longer desired.

Abstract: Loading and unloading a plurality of libraries on a computing device having a loader lock and internal and external counts for each library in the plurality of libraries is disclosed. The libraries assume an initialize state, followed by an initialized state, a pending unload state, and an unload state according to when the internal and external counts are incremented and decremented. When in the pending unload state, the functions of a library that include functions that require acquiring the loader lock exit, the internal count is decremented by one, and the loader lock is released. Prior to entering the pending unload state, a library may be placed into a reloadable state. A library in the reloadable state may be reloaded upon request until a timer times out. When the timer times out, the library in the reloadable state transitions into the pending unload state.

Abstract: A system and method for managing data, such as in a data warehousing, analysis, or similar applications, where dataflow graphs are expressed as reusable map components, at least some of which are selected from a library of components, and map components are assembled to create an integrated dataflow application. Composite map components encapsulate a dataflow pattern using other maps as subcomponents. Ports are used as link points to assemble map components and are hierarchical and composite allowing ports to contain other ports. The dataflow application may be executed in a parallel processing environment by recognizing the linked data processes within the map components and assigning threads to the linked data processes.

Abstract: A method, system and computer-readable medium for configuration file sharing are presented. In a preferred embodiment, the method includes the steps of: creating, in a controller, a superset registry file that includes old registry data, new registry data, and kindred registry data, wherein the old registry data and the new registry data are incompatible, and wherein the kindred registry data is compatible with both the old registry data and the new registry data; and contemporaneously downloading the kindred registry data and software version-specific registry data, selected from the old registry data and the new registry data, to a requesting client.

Abstract: A system and method are described for performing efficient multi-parent class loading. In one embodiment, a request is received at an initiating class loader. A set of class loaders capable of loading the class is narrowed to a set of candidate class loaders. The narrowing of the set of class loaders is performed based on a previously built data structure. A parent class loader from a previously built array of class loaders is used to load the class if the parent class loader is an element of the set of candidate class loaders.

Abstract: A method and system is provided for data/process sharing. A decapsulating unit is provided and resides on first system where a first application system resides. The decapsulating unit monitors, on the first system, when encapsulated data from a second application system residing on a second system, is present in the first application system. The encapsulated data, once present on the first system, is decapsulated by the decapsulating unit to obtain a trigger corresponding to the second application system and encapsulated in the encapsulated data. The obtained trigger is analyzed and the second application system is launched on the first system based on the trigger.

Abstract: A method and memory for storing data for access by an application program being executed on a computing device, comprising: a data structure stored in said memory, said data structure including information that embodies software project dependency relationships used by said application program and including: a plurality of nodes, each of said nodes including at least one of: a list of one or more source files associated with a project and a binary-path; and wherein the binary-path can include at least one of: a directory, an identity of an entity where source code can be found, and a reference to another CPL node.

Abstract: System and method for the hot deployment of shared modules, for example standalone resource adaptor modules (RARs), in systems. A class loader mechanism may utilize, in a hierarchy of class loaders, a shared “delegator” class loader which delegates received load class requests to a chain of class loaders, each representing a hot-deployable module. Hot deployment of a module results in the redeployment of the associated class loader in the chain rather than in a single, shared class loader. In one embodiment, when a load class request is received, the delegator class loader traverses the chain to find the class loader to load the class indicated by the request, the request is delegated to the class loader, and the class loader loads the class. If the module and class loader are subsequently redeployed, the redeployed version of the class loader loads the new version of the class.

Abstract: A client or Web application assembly or group of assemblies is bound to a version of shared assemblies associated with a particular targeted execution environment. The targeted execution environment (and thus the version of shared assemblies associated with it) may be selected or detected. A file such as a configuration file is automatically modified. The selected or detected execution environment may be the same as or different than the local version. The client or Web assembly is automatically bound to the targeted shared assemblies. A user interface enables the selection of a particular execution environment. Alternatively, a user interface informs of the detected targeted execution environment and enables the reconfiguration of the Web assembly. This invention provides a mechanism and process for maintaining legacy software after a new software development tool is installed, without deploying a new version of shared assemblies.

Abstract: A profiling method executed by a computer and system including generating a source code by adding a call instruction for a profile acquisition function to a source program of an application, generating an execution form of a profiling target program by linking a library of profile acquisition functions to the source code, executing the profiling target program in an operating system of a target system, calling a profile acquisition driver by executing the call instruction of the profile acquisition function via the library of the profile acquisition functions, and acquiring sampling information on an execution status of the profiling target program based on an interrupt occurrence by the profile acquisition driver.

Abstract: A network-based collaboration system and method can be used to create, modify or otherwise manipulate a design using heterogeneous applications on clients connected to a network. The system and method enables design collaboration between the heterogeneous applications each having a different design abstraction and a different local data model by exchanging application states normalized at a design abstraction level recognized by each of the heterogeneous applications.

Abstract: Methods and apparatus, including computer systems and program products, for sharing classes and class loaders. One implementation provides a technique for performing a shared load procedure for a class, performing a post load procedure for the class, performing a shared link procedure for the class, performing a post link procedure for the class, and performing an initialization procedure for the class to reduce memory consumption and class loading time. Through performance of these procedures, a first portion of the class (which may include a class block and object) is loaded into a shared memory accessible by multiple runtime systems, and a second portion of the class (which may include a class static variable) as is stored in a local memory associated with a selected runtime system. A shared master copy of the second portion of the class is also stored in the shared memory.

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: A system that facilitates generation of code from a HMI representation of objects in an industrial automation environment. A component analyzes the HMI representation of objects, and a code generation component generates code based at least upon the analyzed HMI object.

Abstract: A consistency test program which facilitates the user to check whether a compiled machine code file reflects all modifications made to its source file. When a source code is compiled into a machine code, a source file attribute record is produced from file attributes of the source file and added to the resultant machine code file. The record includes file location of the source file, and information such as file size and timestamp that will be updated each time the source file is modified. The source file attribute record enables the user to check afterwards whether the machine code file is still consistent with the latest source code. This consistency test is performed by extracting the source file attribute record from the machine code file, obtaining current attributes of a file that is located by the file location information, and comparing the source file attribute record with the current attributes.

Abstract: One embodiment of the present invention provides a system that facilitates efficiently resolving symbolic references in a virtual machine to support in-place execution. During operation, the system loads an in-place executable file into the virtual machine, and receives a pointer that points to an unresolved symbol value in the in-place executable file. This unresolved symbol value includes an offset value that points to a subsequent unresolved symbol value in a chain of unresolved symbol values within the in-place executable file, and a token value that can be used to look up a corresponding resolved reference value in an unresolved symbol table. The system then uses the token value to look up the corresponding resolved reference in the unresolved symbol table, and replaces the unresolved symbol value with the corresponding resolved reference.

Abstract: The speed of execution of linked programs is improved to the extent possible within the limit of the capacity of memory storing linked programs. As initial settings, all class libraries are set for linking. By this means, all class libraries are linked. Then, a judgment is made as to whether there is overflow of memory storing linked programs. If there is overflow, the maximum value of the number of applications using currently linked class libraries is set in variable N. Then, settings are modified such that class libraries used by N or more applications are not linked, and linking is again performed. If memory overflow does not occur, processing ends.

Abstract: The method for updating an autorun program of a portable electronic entity includes: a step of connecting said entity to a host station, a step (250) of executing in said host station a program stored by said entity and adapted to be executed automatically in said host station on connection of said entity to said host station, and a step (260-285) of secure modification of said program.