Abstract: This invention is a fully functional workflow platform or middleware on a mobile device that is able to create, modify and execute its own workflow scripts and synchronize with external services on the mobile device or on a remote back-end such as a server using asynchronous and/or synchronous communications. This invention also includes a back-end computing platform that integrates with the mobile device. The back-end platform also provides a marketplace and tools for multiple parties to develop and trade configurations of the platform and software that may be used to extend the capabilities of the workflow platform and license the use of the platform's complete set of capabilities.

Abstract: The programing support system creates programing support data. The programing support system analyzes a program for simulating and determines the call relationship of the program on the basis of the analysis result and a call time and an execution time on the basis of the analysis result and simulation result. The programing support system displays a programing support screen which visually express the programing support data.

Abstract: Dump file content and other event data is pruned and prioritized to assist analysis of hangs, crashes, and other circumstances. An event data pruner condenses or excludes certain event data. A cluster creator creates clusters from pruned and vectorized event data, using a clustering algorithm and a similarity metric, without any prior specification of the desired number of clusters. A cluster ranker ranks clusters according to event data volume and thread importance, thus prioritizing the event data for inspection. A results presenter configures a user interface to present ranked clusters, their associated data, data reduction statistics, regression analysis results, and other data reduction processing results. Thus, the innovative functionality assists analysis and prioritized inspection of event data by an analyst, surfacing organized event data that is relevant to the circumstance under investigation, or supporting comparison of clusters from before and after a change in the circumstance, or doing both.

Abstract: Reuse of a thread-local return data structure to prevent a return data structure from being allocated every time asynchronous functions return. The system returns thread operation from the asynchronous function back to the caller function in a manner that the return data structure can be reused for future asynchronous function returns within that same thread. To do so, the system first accesses data that was generated by the asynchronous function in response to the caller function placing the function call to the asynchronous function. To determine if reuse is appropriate, the system determines that the caller function will use the return data structure as populated only once. If so, the system populates the reusable thread-local return data structure and returns that data structure to the caller.

Abstract: A method is described for exchanging a first executable program code and a second executable program code, as well as a control unit, including an active storage medium. The active storage medium contains the first executable program code for operating the control unit. A passive storage medium includes the second executable program code for operating the control unit. A data packet control unit, which is configured to exchange the first program code and the second program code, based on the method, is also described.

Abstract: A method for improving the performance of applications executed within asynchronous processor architectures. In an embodiment, a method for improving execution time of compiled synchronized source code on an asynchronous processor architecture includes receiving, by a processing system, synchronized source code comprising synchronization instructions to synchronize execution of the synchronized source code on different pipelines of the asynchronous processor architecture. The method also includes analyzing, by the processing system, the synchronized source code to determine whether the synchronized source code includes a broken code condition.

Abstract: Systems and methods for production readiness verification and monitoring are disclosed. A set of compliance requirements including one or more cloud-specific requirements and status information regarding a status of each of a plurality of clouds within a cloud environment is received. The status information includes availability of one or more servers within each of the plurality of clouds. The status information for each of the plurality of clouds is compared to the one or more cloud-specific requirements and the cloud environment as identified as one of compliant or non-compliant. The cloud environment is identified as compliant when each of the one or more cloud-specific requirements are satisfied and non-compliant when at least one of the one or more cloud-specific requirements are not satisfied.

Abstract: Methods and apparatus are described by which a rich, time-correlated information set is captured during automated testing of an application in a way that allows the application developer to understand the state of the application under test (AUT), the browser interacting with the AUT, and/or the device interacting with the AUT, as it/they changed over time. Mechanisms or features associated with browsers and/or device operating systems are exploited to capture such information, not only for the purpose of better understanding individual test runs, but also to enable the use of analytics over data sets.

Abstract: Systems and techniques that facilitate automated recommendation of microservice decomposition strategies for monolithic applications are provided. In various embodiments, a community detection component can detect a disjoint code cluster in a monolithic application based on a code property graph characterizing the monolithic application. In various aspects, the code property graph can be based on a temporal code evolution of the monolithic application. In various embodiments, a topic modeling component can identify a functional purpose of the disjoint code cluster based on a business document corpus corresponding to the monolithic application. In various embodiments, a microservices component can recommend a microservice to replace the disjoint code cluster based on the functional purpose.

Abstract: Ahead-of-time (AOT) and just-in-time (JIT) compilation can be combined to improve application deployment. For example, an application can be deployed in a first container for responding to requests associated with the application. The first container is configured to execute the application at least in part by performing JIT compilation. While the application is deployed within the first container, program code for the application can be compiled in a second container by performing AOT. Based on determining that AOT compilation is complete, a system can be configured to respond to subsequent requests associated with the application by executing the machine code.

Abstract: A dynamic Scalable Vector Graphics (SVG) system and associated methods are provided for rendering an interactive software-product demonstration presentation for an envisioned software product within a webpage. A script can be executed to digest an exported SVG file by: querying for target objects having particular attributes named in a target format, and/or particular tag names. For each of the target objects, methods are called to modify that target object based on a first found tag name, a first found attribute, and/or contents of the first found attribute. The called methods can be used to manipulate attributes and/or contents of that target object to modify it and generate a manipulated object that includes the outputs of each called method (e.g., appropriate contents to be inserted into the SVG file). The manipulated objects with the appropriate contents can then be inserted into the SVG file to generate a final SVG file.

Abstract: In an approach, one or more computer processors create a dictionary for each source code commit in a set of historical source code commits associated with a software deployment; create a similarity model based on the created dictionary for each source code commit in the set of historical source code commits; generate a vector embedding for a source code commit pair based on a set of log differences between source code commit pairs utilizing the created similarity model; generate, responsive to a new source code commit, a new vector embedding based on a set of log differences between the new source code commit and a preceding source code commit utilizing the created similarity model; generate a defect likelihood utilizing the generated new vector embedding; determine, responsive to the generated defect likelihood exceeding a defect likelihood threshold, that the new source code commit contains defects.

Abstract: A test device may include a performance module to determine entropy values for images, such as of a graphical user interface, to be presented on a display device of the test device. An entropy value for an image may be indicative of a distribution of data values, such as intensity or color values for pixels in the image. Patterns of entropy values over time may provide information indicative of performance of the test device. For example, a constant entropy value over time may indicate the graphical user interface is not changing. In another example, particular patterns of entry values over time may be indicative of presentation of wait indicators or other user interface elements. The entropy values may be used to determine data indicative of performance of the test device. This data may be stored locally, sent to an external device, and so forth.

Abstract: Techniques are disclosed for implementing direct memory access in a virtualized computing environment. A memory access policy of the virtualized computing environment is applied to a direct memory access connection request received from a first virtual machine via an exception path. The request is flagged to indicate that the request has been processed and the request is forwarded to a network interface device configured to execute offloaded network functions for one or more virtual machines. A memory access policy of the virtualized computing environment is applied to a direct memory access connection reply received from a second virtual machine on the exception path. The reply is flagged to indicate that the reply has been processed and the reply is forwarded to the network interface device. A direct memory access connection is established between first and second virtual machines in accordance with the request.

Abstract: Taint is dynamically tracked on a mobile device. Taint virtual instructions are added to virtual instructions of a control-flow graph (CFG). A taint virtual instruction has a taint operand that corresponds to an operand of a virtual instruction and has a taint output that corresponds to an output of the virtual instruction in a block of the CFG. Registers are allocated for the taint virtual instruction and the virtual instructions. After register allocation, the taint virtual instruction and the virtual instructions are converted to native code, which is executed to track taint on the mobile device.

Abstract: Operations include diagnosing performance hotspots with minimal performance impact. A system selectively extracts a subset of in-memory application data, for failure analysis, based on application metadata associated with an application. The selective data extraction may be used to generate succinct reports that are customized to explore the specific vulnerabilities of each particular application. Application metadata identifies application data attributes for value extraction. The application metadata may identify, for example, a client attribute which indicates the client which requested the execution of a failed operation (or execution of an operation with a failed sub-function). The application metadata may identify a particular function, associated with an operation, that is to be analyzed in case of operation failure. The application metadata may identify a thread-local variable of a thread, executing an operation, that is to be analyzed in case of operation failure.

Abstract: A dynamic, distributed directed activity network comprising a directed activity control program specifying tasks to be executed including required individual task inputs and outputs, the required order of task execution, permitted parallelism in task execution, task adjacency to subsequent tasks, and reachability from each task to other tasks; a plurality of task execution agents, individual of said agents having a set of dynamically changing agent attributes and capable of executing different required tasks; a plurality of task execution controllers, each controller associated with one or more of the task execution agents with access to dynamically changing agent attributes; a directed activity controller for communicating with said task execution controllers for directing execution of said activity control program; and, a communications network supporting communication between said directed activity controller and task execution controllers for directing execution of said directed activity control program u

Abstract: A method may include obtaining original source code including entities. The entities each correspond to a location in the original source code. The method may further include during an offline phase and by a computer processor, generating, from the original source code, (i) a dependency graph including nodes corresponding to the entities and (ii) a location index that maps each location in the original source code to one of the nodes, and during an online phase following the offline phase and using the dependency graph and the location index: identifying modified locations in the original source code by comparing modified source code to the original source code, obtaining, for each of the modified locations and by searching the location index, matching nodes, determining, for each of the matching nodes, impacted nodes reachable from the matching node, and identifying, using the location index, impacted entities corresponding to the impacted nodes.

Abstract: A computer-processor-implemented data processing method comprises: a computer processor executing instances of one or more processing functions, each instance of a processing function having an associated function-call identifier; and in response to initiation of execution by the computer processor of a given processing function instance configured to modify one or more pointers of a partitioned acyclic data structure: the computer processor storing the function-call identifier for that processing function instance in a memory at a storage location associated with the partitioned acyclic data structure; for a memory location which stores data representing a given pointer of the partitioned acyclic data structure, the computer processor defining a period of exclusive access to at least that memory location by applying and subsequently releasing an exclusive tag for at least that memory location; and the computer processor selectively processing the given pointer during the period of exclusive access in depende

Abstract: Architectures, systems and methods for building trusted and secure artifacts are disclosed. In one embodiment, the method comprises: receiving inputs including one or more instances of software code; verifying trustworthiness of the one or more inputs; creating software code using a forward immutable continuous integration (CI) pipeline having a plurality of stages with forward immutability between consecutive pipeline stages to receive the one or more inputs verified as trustworthy and to build and test one or more containers associated with the one or more inputs, wherein each subsequent stage after a first stage of the pipeline depends on an immutable output of an immediately preceding stage in the pipeline, and further wherein the pipeline includes an emission stage for outputting signed, trusted software code from the pipeline; and storing signed, trusted software code in a repository for deployment, the repository only accepting signed software code for deployment.