Abstract: Techniques are disclosed for generating, on a server, executable files that are individually customized for a user. An exemplary method comprises receiving a download request from a client, the download request including a system type and one or more identification parameters; locating a pre-compiled payload that is executable on the client based on the system type; determining a configuration data for use with the pre-compiled payload based on the one or more identification parameters; and selectively generating a customized executable file for the client to download, wherein the customized executable file includes the pre-compiled payload and the configuration data. Among other benefits, some embodiments provided herein enable dynamic creation and individual customization of executable files for a user so that conventional configuration or personalization steps after the user installs the files are avoided, thereby reducing time consumed and potential confusion caused by such steps.

Abstract: A method, system, and computer-readable medium for self-healing a software factory are presented. Factory metrics that describe resources and operations within the software factory are collected and analyzed. If the analysis reveals a significant problem within the software factory, then corrective measures are taken and stored, thus enabling the software factory to evolve and improve over time.

Abstract: Provides methods for transforming a flowchart to an equivalent tree diagram, methods for transforming an equivalent tree diagram to a flowchart, methods for verifying reorganization of a flowchart, methods for editing a flowchart, methods for creating a flowchart and a flowchart editor. A flowchart includes one or more logic structures and one or more processing activities in said one or more logic structures. The method for transforming a flowchart to an equivalent tree diagram comprises: traversing said flowchart; transforming said one or more logic structures in said flowchart to one or more branching nodes in said tree diagram; and transforming one or more processing activities in said logic structures of said flowchart to one or more leaf nodes below corresponding branching nodes in said tree diagram. Further, edition of a flowchart and verification of reorganization of a flowchart are performed by utilizing an equivalent tree diagram.

Abstract: In an information processing system, when a request for execution of a new task is accepted, one or more of the required processing time and bus bandwidth for the new task are identified. A total required processing time, which is a sum of processing times required for the new task and a task reserved on a scheduler for indicating a procedure pertaining to a plurality of tasks, is compared with a processing time available in an apparatus executing those tasks. Similarly, a total required bus bandwidth, which is a sum of bus bandwidths required for processing the reserved task and the new task, is compared with a bus bandwidth available in the apparatus. Based on the result of the comparisons, it is determined whether the new task is executable.

Abstract: A method, system and program product for correcting semantic errors in code in an integrated development environment. The method includes inputting, using a code editor, code being developed in an integrated development environment, identifying, in a syntax tree constructed for the code inputted, one or more nodes containing semantic errors pertaining to use of a third-party library, choosing a node containing the semantic errors, displaying suggestions for correcting the semantic errors identified for the node chosen, where the suggestions include peer submitted code snippets associated with collaboration records located to correct the semantic errors identified for the node chosen, selecting a code snippet from the code snippets displayed and executing the code inputted in the integrated development environment, such that, the code snippet selected is automatically invoked to correct the semantic errors identified for the node chosen.

Abstract: Selectively recollecting vital product data during an initial program load at data processing system power on is provided. In response to receiving an input to power on a data processing system, a resource location code array table is accessed within a set of selected tables for the data processing system based on machine type. The selected set of tables is located in firmware within a service processor. An entry for a resource in the resource location code array table is read to determine whether the entry includes a no recollect tag. Then, in response to determining that the entry for the resource in the resource location code array table does include a no recollect tag, vital product data for the resource is not recollected during the initial program load.

Abstract: The present invention discloses a solution for increasing the immediacy in determining a point of failure after an unexpected program termination. In the solution, a user determined object is identified by a user at compile time, where the identified object is one to be tracked. The compiler introduces executable code into the source code which is able to track modifications made to the object members during run-time. During execution, the address of each instruction modifying to the object is stored in an instruction pointer (IP) array associated with the tracked object. The IP array is continuously updated during program execution when an instruction modifies a member of the tracked object. When an unexpected program termination occurs, the instruction pointer array can be presented to a debugging agent to assist in determining the instruction causing the termination. The debugging agent can be a human agent, debugging software, report generation software, and the like.

Abstract: Method and system are disclosed for automatically discovering associations between applications and data in multi-tiered distributed systems. The method in one aspect uses a machine-readable specification of a model or template that describes use and transformation of data by software components. The method additionally utilizes a model of system configuration and appropriate runtime support to mine information available from systems management software present in enterprise systems. The application-data association discovery process performs a traversal of the distributed system configuration graph with actions taken during this traversal driven by the contents of the templates for the software components present in the system. The results of the application-data association discovery process are stored in a database and may be used to specify application-specific information lifecycle management (ILM) policy or as input to impact analysis tools in access control and antivirus systems.

Abstract: Improved techniques for automatic (or dynamic) updating (or maintaining) of file groups in a developer environment that stores and executes files are disclosed. The automatic update to file groups can occur when additional files are added to or removed from the developer environment. The automatic update to file groups can also occur when previously stored files are otherwise altered.

Abstract: There is disclosed a method and system for configuring a data dependency graph (DDG) to handle instruction scheduling in computer architectures permitting dynamic by-pass execution, and for performing dynamic by-pass scheduling utilizing such a configured DDG. In accordance with an embodiment of the invention, a heuristic function is used to obtain a ranking of nodes in the DDG after setting delays at all identified by-pass pairs of nodes in the DDG to 0. From among a list of identified by-pass pairs of nodes, a node that is identified as being the least important to schedule early is marked as “bonded” to its successor, and the corresponding delay for that identified node is set to 0. Node rankings are re-computed and the bonded by-pass pair of nodes are scheduled in consecutive execution cycles with a delay of 0 to increase the likelihood that a by-pass can be successfully taken during run-time execution.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for automatic workflow processing in a workflow processing computer system.

Abstract: Managing software is provided. A solution to a problem that has occurred with a program on a client data processing system is received by a server. This solution is created while solving the problem that occurred on the data processing system. The solution includes a process that may be executed on another data processing system to solve the same problem on that data processing system. The process is, for example, a script, a macro, or a set of computer executable steps or instructions. A database of solutions is selectively updated to reflect the new solution. In response to a request for a solution by another client system to a problem, the server will respond with the current solution that exists in the database.

Abstract: A heterogeneous multiprocessor system including a plurality of processor elements having mutually different instruction sets and structures avoids a specific processor element from being short of resources to improve throughput. An executable task is extracted based on a preset depending relationship between a plurality of tasks, and the plurality of first processors are allocated to a general-purpose processor group based on a depending relationship among the extracted tasks. A second processor is allocated to an accelerator group, a task to be allocated is determined from the extracted tasks based on a priority value for each of tasks, and an execution cost of executing the determined task by the first processor is compared with an execution cost of executing the task by the second processor. The task is allocated to one of the general-purpose processor group and the accelerator group that is judged to be lower as a result of the cost comparison.

Abstract: With regard to a plurality of data stored in a memory, relationship of data is grasped twice after a time interval therebetween. Next, increased data C1, E2, E3 which are not present in data of a first time are extracted from data of a second time, and weights “1”, “2”, “2” in accordance with data sizes are attached to the increased data. Next, the weights are successively propagated from a lower order data of a destination of reference to a higher order data of a source of reference successively. When there are a plurality of lower order data E2, E3 for a higher order D0, a weight constituted by adding the weights “2”, “2” of the plurality of lower data E2, E3 is made to be a weight “4” of the higher order data D0, and the weights of the respective data represent leak scores which causes memory leak.

Abstract: A method for detecting problems caused by access to incompletely initialized data storage in assembler programs includes generating an internal representation of control flow of the source code of the assembler program including nodes for every statement found in the source code and a directed edge for every possible flow of control between the nodes. The method also includes: attributing data attributes to the nodes and/or the edges, wherein the data attributes are used to store the information how many bits within the data storage can be guaranteed to be initialized; applying a data-flow analysis method to the internal representation of the control flow of the source code for determining how many bits of the data storage can be guaranteed to be initialized; checking for each node whether the instruction reads more bits than are guaranteed to be initialized; and generating one or more error messages responsive to the problem.

Abstract: A process and system for assisting a user to write new lines of code of a computer program based on code examples. A first line in each code sample matching a specified anchor line. A loop having a custom line branch and a code assist branch is executed. The custom line branch generates a new line for the computer program via a custom line provided by the user. The code assist branch generates a new line for the computer program via code assist. The code assist determines a set of assist lines from the code samples, translates the assist lines to a user context in each code example, selects from the assist lines set of preferred lines sequenced in an order of preference, presents the set of preferred lines to the user, receives a preferred line selected by the user, and stores the preferred line as a new line.

Abstract: A method for debugging a computer program is provided. The method pushes a plurality of registers into a stack, and calculates a jump-from address and a jump-to address for each jump according to values of the registers. The jump-from address and the jump-to address are then stored into a storage system. The method may monitor the execution of the computer program in system management mode (SMM).

Abstract: A system and method for efficient string concatenation in a virtual machine (VM), or other runtime environment, and particularly for use in a system that includes a Java Virtual Machine (JVM). An embodiment improves the performance of string concatenation significantly by analysing the string concatenation chains during bytecode compilation and replacing the dynamic string concatenation code with fixed size structures without bounds checks or locks. The resulting code is also more suitable for inlining.

Abstract: The present invention provides a system and method for detecting problems caused by access to incompletely initialized data storage in assembler and high-level language programs. An internal representation of the control flow of the source code of the assembler program is generated and a data-flow analysis method is applied to the internal representation.

Abstract: A computer implemented method of facilely releasing a BSE software module adapted for execution by an electronic control unit having an update model of the BSE software and a controller having an embedded desktop model of the BSE software, includes a plurality of autonomously performed steps resulting in the compiling of a plurality of c-files into a library file. A single keyword activated preferred embodiment is disclosed in a MatLab®/Simulink®/Real-Time Workshop® environment.