Abstract: A method for performing path-sensitive data-flow analysis for use in error checking functions includes identifying at least a first instruction and a second instruction in a control flow graph of a function. The identified first instruction and second instruction are connected by at least a first control flow path and a second control flow path. The method further includes defining a path condition between the first instruction and the second instruction as a complex disjunction including a first conjunction of predicates for the first control flow path and a second conjunction of predicates for the second control flow path.

Abstract: A connecting apparatus determines whether an external service is compatible with an interface through which a component connected with another component or another external service uses a service of the other component or the other external service, and if it is determined that the external service is compatible with the interface through which the component uses the other component or the other external service, modifies the connection so that the component connected with the other component or the other external service is connected with the external service. The connecting apparatus then executes the component connected with the external service.

Abstract: Systems, methods and products directed toward creating device preloads via employing base and additional image content. One aspect includes communicating an aspect of an information handling device, and assimilating additional image content at the information handling device responsive to communication of the aspect of the device, wherein a base image and the additional image content are combined to form a unitary device image. Other embodiments are described herein.

Abstract: Profile data can be ascribed to groups as a function of an organizational scheme that defines groups and relationships between groups. The groups can be abstractions over profile data that are meaningful for computer program analysis. Subsequently, grouped data can be disseminated, queried, and visualized in numerous ways to further aid program analysis.

Abstract: A method of program compilation to improve parallelism during the linking of the program by a compiler. The method includes converting statements of the program to canonical form, constructing abstract syntax tree (AST) for each procedure in the program, and traversing the program to construct a graph by making each non-control flow statement and each control structure into at least one node of the graph.

Abstract: A loop distribution group detection program for causing a computer to execute a process including, converting a loop distribution target program into a test program having a cache miss measurement instruction, by dividing a loop in the loop distribution target program into plural distribution loops based on a loop distribution specification parameter, sequentially executing the test program while varying the loop distribution specification parameter, extracting loop distribution candidates, for which the number of cache misses exceeds a reference value, as a first loop distribution candidate group, and extracting loop distribution candidates with not exceeding the reference value, as a second loop distribution candidate group, and excluding loop distributions from execution target candidates for the test program, by comparing a loop distribution based on the loop distribution specification parameter with loop distributions of the loop distribution candidates in the first loop distribution candidate group.

Abstract: An automated programming tool can receive program source code and can expand portions of the program source code to make to make identifiers explicit, insert sets of parenthesis and so on. Expansions can be kept track of so that reductions after refactoring can be confined to altered portions of the program source code.

Abstract: A system and method allows a legacy program to call a distributed service in the manner of the legacy program calling another legacy program. The call is translated and sent to the distributed system in a secure manner, with potential timeout issues potentially handled faster than would be handled by the distributed system, and the response is returned to the legacy program in the format that another legacy program would have used.

Abstract: An extension node can be defined in a second layer of a software architecture for a first business object existing in a first layer and originally having an association with a second business object that is also in the first layer. The extension node can be defined to have an association with the second business object existing in a second layer of the software architecture. The association of the second business object can be altered from the first business object to the extension node so that at run time, metadata defining one or more nodes of the first business object and the extension node can be read from a metadata repository and a run time version of the first business object can be constructed at run time in a run time business object load based on the metadata.

Abstract: Techniques and a system for creating a vendor independent computer language and compiling the language into an architecture specification language allowing for taking a source data stream (file, wsdl, xml) and passing thru a language parser, populating a storage medium with a plurality of technical inputs and vendor technical specifications for generic technologies and probable technologies required for desired architectures generated by the language parser, and optimizing the inputs and creating relationships between technologies and groups of technologies and storing results in said storage medium.

Abstract: A device may store dependency information for a group of software components provided by a technical computing environment. The group of software components may include a first software component and a second software component and may identify the second software component as being a dependent software component of the first software component. The device may obtain an application generated via the technical computing environment and may determine that the application invokes the first software component. The device may access the dependency information based on the application invoking the first software component and may determine that the first software component invokes the second software component based on the dependency information. The device may generate a deployable form of the application that allows the application to run in another computing environment.

Abstract: A method includes capturing an image of a scene that includes a diagram. The method further includes applying functional block recognition rules to image data of the image to recognize functional blocks of the diagram. The functional blocks include at least a first functional block associated with a first computer operation. The method further includes determining whether the functional blocks comply with functional block syntax rules. A functional graph is computer-generated based on the functional blocks complying with the functional block syntax rules. The functional graph corresponds to the diagram, and the functional graph includes the functional blocks.

Abstract: A runtime capability check determines functionality supported by a client application (e.g. a browser) on a computing device. During the runtime capability check, the client application (e.g. the browser) attempts to execute different function tests to determine its capabilities. The result information from the function tests are stored. The stored result information is used by the client application during subsequent connections with the server (e.g. the cookie is passed from the mobile computing device to the server). Based on the supported functionality as determined by the stored result information, the rendering code is adapted for, generated and delivered to the computing device by the server. For example, when the client application supports the tested functionality then the server renders the content using full feature rendering. When the client application does not support all of the tested functionality then the server renders the content using limited feature rendering.

Abstract: An exemplary embodiment of the present disclosure illustrates a hybrid dynamic code compiling device having a parser, a native code generator, and a dynamic code rewriter, wherein the parser is coupled to the native code generator and the dynamic code rewriter. The parser receives and parses a first dynamic code to divide the first dynamic code into compilable blocks and non-compilable blocks. The native code generator generates a native code according to the compilable blocks. The dynamic code rewriter rewrites the non-compilable blocks to generate a second dynamic code, wherein the second dynamic code has function calls which communicate between the native code and the first dynamic code.

Abstract: Exemplary embodiments include a computer-implemented method for generating agile user stories, the method including collecting, by a processor, a plurality of requirements, creating, by the processor, a plurality of content space specification files that includes the plurality of requirements, processing, by the processor, the plurality of content space specification files to generate the user stories and outputting, by the processor, the user stories.

Abstract: A computer is used to generate an approximation of a workflow in terms of worklets and transitions. Each worklet represents a phase of work in the workflow. Each transition indicates conditions for completion of a worklet. Each worklet includes at least one assistlet having executable code that will be executed for approximating of its work phase.

Abstract: The various aspects provide a dynamic compilation framework that includes a machine-independent optimization module operating on a computing device and methods for optimizing code with the machine-independent optimization module using a single, combined-forwards-backwards pass of the code. In the various aspects, the machine-independent optimization module may generate a graph of nodes from the IR, optimize nodes in the graph using forwards and backwards optimizations, and propagating the forwards and backwards optimizations to nodes in a bounded subgraph recognized or defined based on the position of the node currently being optimized. In the various aspects, the machine-independent optimization module may optimize the graph by performing forwards and/or backwards optimizations during a single pass through the graph, thereby achieving an effective degree of optimization and shorter overall compile times.

Abstract: A web-based interface is provided for visually modeling a business-to-business or application integration process by selecting and associating predetermined process-representing visual elements. A customized, enterprise-specific executable software application (“dynamic runtime engine”) is automatedly produced by software running remotely. The dynamic runtime engine is created to include a generic application template, predefined “stock” codesets selected as a function of the modeled process, and a data profile codeset that includes input provided by the user for customizing the stock components for a specific integration process of a specific enterprise.

Abstract: Technologies are described herein for converting a desktop application to a web application. An interface file is generated based on a user interface of the desktop application. A logic file is generated based on application executables of the desktop application. A data model is generated based on application data and states of the desktop application. The web application is generated based on the interface file, the logic file, and the data model.

Abstract: Embodiments provide implementations for estimating a test application's energy usage on a target device based on execution of the test application. Resource usage associated with the execution of the test application is measured. The measured resource usage is input into a power model of the target device to estimate the energy that the test application uses when executed on the target device. An emulation system is configured to execute the test application in a virtual execution environment using resource scaling and simulated target device application programming interfaces to substantially simulate the corresponding capabilities of the target device.