Abstract: A software update manager running on an information handling system over a type 1 hypervisor operating system retrieves a virtual firmware update through a primary network interface. The virtual firmware update executes over the hypervisor to initiate a download of a firmware update to a management processor of the information handling system through a management network interface. The firmware update executes to update the firmware of the information handling system with an update process managed by an end user through the primary network interface and the software update manager.

Abstract: A method is included for loading a main loadable file and at least one optional loadable file during initialization of a computer system. The method includes loading a main loadable file which includes a resident portion and an input/output network interface software component. The resident portion is a utilization software component configured to use transmission protocols. The method also includes determining which optional loadable files are required to be loaded. The optional loadable files each include an optional portion. The method also includes loading the optional loadable files which contain optional portions corresponding to required protocols.

Abstract: Debugging of code of a computer program is facilitated by implementing a step-type operation using internal breakpoints to ensure debugger control of the code. During a debugging session, a step-type operation is implemented by setting active internal breakpoints on every line of code of every routine currently on the call stack referenced by the processor and on entry points of the code being debugged, and subsequently leaving in place, upon completion of the step-type operation, active internal breakpoints. Subsequent to implementing the step-type operation any active internal breakpoints encountered during execution of one or more other operations of the code and deemed unnecessary to completion of the other operation(s) are disabled, and the location of any internal breakpoints disabled during execution of the one or more other operations are tracked in a data structure(s) for subsequent use in reestablishing needed internal breakpoints for implementation of another step-type operation.

Abstract: An installed hardware of a measuring field device includes at least one transducer reacting during operation to a chemical and/or physical, measured variable of a pourable and/or flowable medium, especially a pourable or flowable bulk good, liquid, gas or the like, as well as a microcomputer communicating during operation with the transducer. The field device is first installed by means of the transducer on, and/or in a process vessel serving for conveying and/or holding pourable and/or flowable media for forming a process measuring point. Thereafter, the microcomputer is booted and a basic software held in a memory provided within the field device for providing, at least in part, basic functionalities of the field device is activated in such a manner that the basic software is executable by means of the microcomputer so that, in the interaction of basic software and hardware installed in the field device, the basic functionalities of the field device are available.

Abstract: A provisioning server can import a software distribution and determine the type of distribution in order to integrate the software distribution in the software provisioning environment. The provisioning server can be configured to determine a type for the software distribution. Once determined, the provisioning server can be configured to locate a configuration template that matches the type of the software distribution. The configuration template can allow the generation of a configuration file that enables the software distribution to be incorporated into software provisioning processes, automatically. Once located, the provisioning server can be configured to generate a profile for the imported software distribution.

Abstract: An illustrative embodiment provides a computer-implemented process for algorithm complexity identification through inter-procedural data flow analysis receives a call graph to form a set of received nodes in a static analysis framework, identifies a parent node in the set of received nodes to form an identified parent, traverses the call graph from the identified parent node to a node to identify a function within the node to form an identified function. Each identified function is analyzed to form a complexity value in a set of complexity values. Responsive to a determination that node analysis is complete, and responsive to a determination that path analysis is complete, determines whether path analysis for the identified parent is complete. Responsive to a determination that path analysis for the identified parent is complete, sum the complexity values in the set of complexity values for the identified parent and return the complexity value for the identified parent to a requester.

Abstract: A system may be configured to receive a request to generate code based on a model. The model may include a logical entity associated with a variable. The system may further be configured to identify a boundary for the variable based on a code section of the code corresponding to the logical entity and add alignment code to the code. The alignment code may be for the variable and based on the boundary.

Abstract: Embodiments described herein relate to systems and methods for displaying aggregated stack traces in a source code viewer. One or more execution identifiers are received in response to an execution of a first program executing on one or more client computing devices. Each execution identifier can include one or more stack frames, which correspond to a function call within the first program. An error-likeliness score is identified for each execution identifier. An error-weight is determined for each of the execution identifiers based on the identified error-likeliness scores for instances of the execution identifiers.

Abstract: A version control system includes a mechanism for a learning roadmap based on information available from a source repository. More particularly, the mechanism generates an easily understandable timeline of a project and a directory of developers based on information available in the version control system that contains the source content of a project. The timeline for the project may be tied to the directory of developers. Under each date in the timeline, a list of developers and their roles and commits may be listed.

Abstract: A system and method for optimizing the object code of a computer program is disclosed. The method includes receiving one or more object code units from the memory; identifying first and second identical program entities in the one or more object code units, wherein each program entity has an object code segment and an associated address; updating the one or more object code units by merging the first identical program entity with the second identical program entity if neither of the first and second program entities is subject to an operation on the respective program entity's address; and linking the updated one or more object code units into an executable program.

Abstract: Modeled test cases are created by converting test cases of each component, which describe interface call orders for the component, into expressions with a level of abstraction increased by excluding component unique information included in the test cases using classification information of interfaces provided by the component. Modeled test cases as differences are extracted by comparing the modeled test cases between a plurality of components.

Abstract: The min-repro finding technique described herein is designed to ease and speed-up the task of finding a min-repro, a minimum configuration that reproduces a problem in database-related products. Specifically, in one embodiment, the technique simplifies transformations in order to find one or more min-repros. One embodiment provides a high-level script language to automate some sub-tasks and to guide the search for a simpler the configuration that reproduces the problem. Yet another embodiment provides record-and-replay functionality, and provides an intuitive representation of results and the search space. These tools can save hours of time for both customers and testers to isolate the problem and can result in faster fixes and large cost savings to organizations.

Abstract: An Internet infrastructure supports a timed window and version-based historical search service comprising a search server that receives a search string from a client device and a historical data repository from where the historical Internet data is retrieved when searching. A client device has a network browser that accesses a historical data support module that facilitates searching of historical data and displaying the historical Internet data to user. The network browser provides options for inputting a search string, accepting user search preferences, viewing timeline-based historical information, or viewing version-based historical search results. The network browser supports refinement of timeline searches with different historical version access, and vice versa.

Abstract: One embodiment constructs a graph comprising one or more parameter nodes and one or more transformation nodes, wherein: each parameter node represents one or more parameters; and each transformation node represents one or more transformations; and sequentially applies from a lowest level to a highest level of the graph, the one or more parameters represented by each parameter node and the one or more transformations represented by each transformation node to a static resource to determine one or more versions of the static resource.

Abstract: One embodiment of the present invention sets forth a technique for translating application programs written using a parallel programming model for execution on multi-core graphics processing unit (GPU) for execution by general purpose central processing unit (CPU). Portions of the application program that rely on specific features of the multi-core GPU are converted by a translator for execution by a general purpose CPU. The application program is partitioned into regions of synchronization independent instructions. The instructions are classified as convergent or divergent and divergent memory references that are shared between regions are replicated. Thread loops are inserted to ensure correct sharing of memory between various threads during execution by the general purpose CPU.

Abstract: A method and system for migrating a UML model across UML profiles. After retrieving a UML model, a source UML element, a source UML profile, a source stereotype, and a source meta-class, the target UML profile, stereotype and meta-class are looked up in a mapping table based on the source UML profile, stereotype, and meta-class. The target UML profile is applied on the UML model. Based on the source meta-class being different from the target meta-class, relationships of the source UML element are retrieved, a target UML element is created, the relationships are copied to the target UML element, and the source UML element is removed from the UML model. The target stereotype is applied to the target UML element. The source stereotype is removed from the target UML element. The source UML profile is removed from the UML model.

Abstract: A method, a system and a computer program product for hierarchical program source management retrieve a main program from a memory and initiate a layer representing a portion of the main program for editing on the display. Program code is edited within the layer in response to detected user programming inputs. A layer abstract syntax tree corresponding to the edited program code is generated. The layer abstract syntax tree is compared with a main program abstract syntax tree and a layer file is generated including the differences between the layer abstract syntax tree and the main program abstract syntax tree.

Abstract: A programming interface and infrastructure of the present invention includes a Shell programming interface and infrastructure (Shell construct), at least one Logic construct, and at least one Data construct. A method for programming using at least one Shell construct, at least one Data construct, at least one I/O construct, and at least one Logic construct. In this method, the at least one Logic construct is independent from the at least one I/O construct.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to defect classification for software development and provide a method, system and computer program product for automated defect classification in a software development tool. In an embodiment of the invention, a defect classification method can be provided. The method can include computing differences between versions of a line of source code, lexically analyzing the computed differences to produce a lexical construct, mapping the lexical construct to a classification, and assigning the defect classification to the line of source code.

Abstract: A solution is proposed for testing a notification-based software application in a service oriented data processing environment (e.g., implementing the WS-Notification specification). The software application includes one or more notification producers. Each notification producer is adapted to distribute notification messages (e.g., of the SOAP type) to notification consumers that are subscribed thereto—according to a specification defined in a corresponding publication, such as a WSDL document. For each notification producer, a corresponding method starts with the step of creating a subscribe request according to the publication—in order to subscribe a tester as a notification consumer to the notification producer. The subscribe request is then submitted to the notification producer. At this point, there is verified a result of the subscription. The method continues by verifying a reception by the tester of a test notification message from the notification producer.