Abstract: In one embodiment a method is provided for rendering a software map. The method includes storing, in an electronic database, information associated with a software development project, the information including start and end dates of particular efforts made in connection with the software development project and dates of specific events associated with the software development project, rendering on a display a timeline, and rendering on the display a software map, wherein the software map includes horizontal lines representing the particular efforts that extend between endpoints defined, substantially, by the start and end dates, and that are aligned with a time scale of the timeline, and vertically or substantially vertical extending lines between and connecting pairs of horizontal lines, wherein each vertically or substantially vertically extending line represents one of the specific events associated with the software development project.

Abstract: A computer-based analysis of an enterprise computer system is utilized to remove bottlenecks that cause the enterprise computer system to operate in a non-optimal or risky manner. Contents of e-mails are examined to identify bottlenecks in the enterprise computer system. Upon identifying the bottlenecks, the enterprise computer system is simulated, and simulations of replacement components, which the computer-based analysis has deemed appropriate for curing the bottlenecks, are installed in the simulated system. If the computer simulation with the replacement components cures the bottlenecks and causes no new problems for the enterprise computer system, then corresponding actual replacement components are installed in the enterprise computer system.

Abstract: A method, system, and computer usable program product for updating firmware without disrupting service are provided in the illustrative embodiments. An updated firmware code is sent to a first firmware component and a second firmware component. The first firmware component is a primary firmware component and the second firmware component is a backup firmware component in a redundant firmware configuration. The updated firmware code is installed in second firmware component. The updated firmware code is activated in a third firmware component. The third firmware component is in communication with the first firmware component. A fail-over from the first firmware component to the second firmware component is performed such that a user communicating with the data processing system and receiving a service using the first firmware component continues to receive the service using the second firmware component without a disruption in the service.

Abstract: The aspects enable a computing device to allocate memory space to variables during runtime compilation of a software application. A first variable associated with a code segment within code being compiled may be identified and assigned a priority tag. A second variable associated with another code segment within the code being compiled may also be assigned a priority tag. A determination may be made regarding whether the first and second variables are contemporaneously live during execution, and whether legal storage location sets for the first and second variables overlap. The assigned priority tags may be used for assigning storage locations to the first and second variables based on the determination.

Abstract: A system and method for declaring variables during coding of a software program. The method includes, for each variable type, defining a unique string representing a variable declaration instruction and adapting a coding module wherein, when a string representing a variable declaration instruction is typed adjacent to a new variable name, the coding module automatically generates code for the corresponding variable declaration statement for a new variable having the new variable name and the specified variable type. The method further includes defining a reserved variable declaration area in the software program and placing any code generated by the coding module for the variable declaration statement into the reserved variable declaration area. Each unique string representing a variable declaration instruction may be a prefix or suffix that may be typed adjacent to the new variable name.

Abstract: Methods and systems are described for testing methods and other functions by swapping external functions for mock functions. A test case definition is entered by a programmer, which can specify the expected number of arguments and argument values of external function or method calls, the context state, the return value, and any expected error conditions. The test case definition is used by a function tester to automatically create mock functions, modify the target function so that it calls the mock functions, execute the target function with specified arguments and a test context, and then compare the results to expected results.

Abstract: Installing a program on a first or primary computer system, and duplicating the installation on a second or secondary computer system. At least some of the illustrative embodiments are methods comprising installing a software program on a first computer system by way of a human interacting with the first computer system (the installing by way of a plurality of operations), programmatically duplicating each operation on a second computer system coupled to the first computer system (the duplicating of each operation on the second computer system in real time with each operation on the first computer system), programmatically analyzing a result of each operation on the first computer system against a result of each operation on the second computer system, and notifying the human (by way of the first computer system) when the result of the operation on the second computer system is unexpected.

Abstract: A wake-and-go mechanism may be a programming idiom accelerator. As a processor fetches instructions, the programming idiom accelerator may look ahead to determine whether a programming idiom is coming up in the instruction stream. If the programming idiom accelerator recognizes a programming idiom, the programming idiom accelerator may perform an action to accelerate execution of the programming idiom. A compiler may recognize programming idioms and expose the programming idioms to the programming idiom accelerator within the resulting machine language instructions.

Abstract: An electronics module for a well installation configured to receive software via a wireless connection and methods of installing software on an electronics module for a well installation, are provided. An example of such electronics module comprises a short-range wireless receiver for wirelessly receiving software and/or data from an external wireless source. Modem external interface wiring can be employed as an antenna for the wireless receiver to receive the wireless transmission of the software and/or data.

Abstract: A method, system, and computer program product for facilitating deduplication product testing in a computing environment is provided. At least one deduplication test file is generated. The at least one deduplication test file is adapted for, when processed through the deduplication product testing, exhibiting a predefined deduplication factor. A definition file is initialized. The definition file defines at least one file characteristic addressed during the generating the at least one deduplication test file to obtain the predefined deduplication factor. The file characteristic may include a file pattern, a file/pattern ratio, and a pattern across multiple files.

Abstract: A computer-implemented process for deductive reaching definition analysis receives a control flow graph to form a set of received blocks and edges, performs traditional reaching definitions to produce bit-vectors OUT(b), GEN(b) and KILL(b) for each block in the set of received blocks and receives impossibility indicators for a set of definitions that are impossible on specific edges. The computer-implemented process further performs deduction operations using a combination of the bit-vectors and impossibility indicators to deduce that additional definitions cannot reach certain blocks to create resulting reachability information and provides the resulting reachability information as a result to a requestor. A related system and program product is also provided.

Abstract: Visual representations of multiple call stacks in a parallel programming system include a stack segments graph constructed by coalescing data from multiple stacks. The graph has nodes that represent stack segments and has arcs between adjacent segments. Similar stack frames are represented by the same node. In a stack prefix view of the graph, arcs are directed from a node representing stack frames to a node representing subsequently executed stack frames. In a method-centered view, an arc is shown between a node representing stack frames of a selected method and a node representing adjacent stack frames. The graph can be based on call stacks of all tasks or all threads, or based on call stacks of tasks or threads flagged by a user. Stack frame, thread, and/or task details are also displayed.

Abstract: A method for multi-scenario software deployment includes creating a software deployment plan that includes at least one task granulated into independently executable sub-tasks; and saving the software deployment plan on a computer readable medium. A computer program product for multi-scenario software deployment includes computer usable program code configured as a software deployment program which runs on a controlling computing device; the software deployment program being configured to: query a user for deployment parameters corresponding to software to be deployed to a target computing device(s); and create a plan for deploying software to a target computing device(s) which can be performed automatically and includes tasks that can be independently performed by separate people. The tasks deploying the software to the target computing device(s) are then performed according to the deployment parameters.

Abstract: A computer-based analysis of an enterprise computer system is utilized to identify pain points that cause the enterprise computer system to operate in a non-optimal or risky manner. Upon identifying the pain points, the enterprise computer system is simulated, and simulations of replacement components that the computer-based analysis has deemed appropriate for curing the pain points are installed in the simulated system. If the computer simulation with the replacement components cures the pain points and causes no new problems for the enterprise computer system, then corresponding actual replacement components are installed in the enterprise computer system.

Abstract: A system and method for building virtual appliances using a repository metadata server and a dependency resolution service is provided. In particular, a hosted web service may provide a collaborative environment for managing origin repositories and software dependencies, whereby remote clients may follow a simple and repeatable process for creating virtual appliances. For example, the repository metadata server may cache and parse metadata associated with an origin repository, download software from the origin repository, and generate resolution data that can be used by the dependency resolution service. The dependency resolution service may then use the resolution data to resolve dependencies for a package selected for an appliance, wherein the dependencies may include packages that are required, recommended, suggested, banned, or otherwise a dependency for the selected package.

Abstract: A debugging tool pauses or stops the execution of a computer program midway through the evaluation of a single line of source code that contains multiple expressions. A debugging tool pauses or stops the execution of a computer program after evaluating and executing one or more expressions within a particular line of source code, but before evaluating and executing one or more other expressions within that same particular line of source code. Thus, programmers can use such a debugging tool to debug a computer program at a level of granularity that is finer than source code line-level. Programmers can use such a debugging tool to debug a computer program, using breakpoints and/or stepping, at an expression-level of granularity.

Abstract: Methods are provided for marking and merging individual report elements, patterns, or defects resulting from analysis based on common characteristics within a report or across reports resulting from different analysis runs. Methods are also provided for migrating a set of report elements, patterns, or defects resulting from one version of an analysis tool to one consistent with a new version of the analysis tool while preserving as much information as possible from the older set.

Abstract: The dynamic creation of a client-side environment for problem analysis includes the delivery and installation of a cohesive file structure to a client-side machine, the cohesive file structure including a data structure containing data files and an analyzer tool.

Abstract: Results of an execution of a function including customizable steps, may be verified. Multiple of steps of the function, may be determined and may the customizable steps that have been customized. Results may be determined based on an execution of the function, wherein the execution uses values provided as inputs to the function. A result view for verifying the one or more results may be provided, the result view may include the steps of the function, the values corresponding to the inputs, and the results.

Abstract: A request for a mashup widget having multiple versions from an identifiable source can be identified. A data store can be queried to determine if a previous request for the mashup widget was made by the identifiable source. When the previous request exists, a version of the mashup widget used to handle the previous request can be automatically determined. The determined version can be one of many versions of the mashup widget. The determined version of the mashup widget can be used to generate a response to the request. When the previous request is not found when querying the data store, one of the mashup versions that is to be used can be determined based upon a programmatic rule. Historical data regarding widget version use can be saved in the data store and used to determine which widget version is to be selected to handle future requests.