Abstract: Some embodiments of the invention provide a method for defining code-based policies. The method generates a policy-builder first view of a policy for display in a graphical user interface (GUI) by processing a syntax tree that is generated from a code second view of the policy. The method receives, through the policy-builder first view, a modification to a portion of the policy. To reflect the modification, the method updates a portion of the syntax tree that corresponds to the portion of the policy that is affected by the modification. Based on the updating of the syntax tree, the method updates the code second view by modifying a portion of the code second view that corresponds to the updated portion of the syntax tree.

Abstract: A system and method of generating a reuse metric starts with a processor receiving from a client device, a program comprising modules. Processor extracts the modules from the program and generates frequency tables associated with the modules. Frequency tables includes numbers of imports associated with the modules, and import ratios associated with the modules. Processor generates, based on the frequency tables, a histogram of the modules and the import ratios. Processor generates key statistical measures based on the import ratios and the histogram. Generating the key statistical measures comprises determining histogram weights, determining a Pareto fit of the histogram, and generating a reuse metric based on the Pareto fit and a Kurtosis of the histogram weights. Processor causes the client device to display the reuse metric and the histogram. Other embodiments are disclosed herein.

Abstract: Methods, systems, and computer program products for constraints-based refactoring of monolith applications through attributed graph embeddings are provided herein.

Abstract: A method implemented by a data processing system including: accessing the container image that includes the first application and a second application; determining, by the data processing system, the number of parallel executions of the given module of the first application; for the given module, generating a plurality of instances of the container image in accordance with the number of parallel executions determined, for each instance, configuring that instance to execute the given module of the first application; causing each of the plurality of configured instances to execute on one or more of the host systems; and for at least one of the plurality of configured instances, causing, by the second application of that configured instance, communication between the data processing system and the one or more of the host systems executing that configured instance.

Abstract: Systems and methods for automatic validation of software components comparing source code and feature documentation are provided herein. An exemplary method includes assessing functional validation of software components by comparing the claimed features of software components against the features extracted from their source code. To prevent the issue of having to try unverified software components the present disclosure provides a solution that uses machine learning to extract claimed features of a software component and its actual features that are implemented in its source code. Then, for evaluating the software components, the disclosed solution compares the claimed features of software components against the features extracted from their source code to give a validated score to the developer so that the developer can easily decide on choosing the validated software.

Abstract: Implementing an application for a data processing engine (DPE) array can include detecting, using computer hardware, a component of a hardware library package instantiated by an application. The application is specified in source code and is configured to execute on a DPE array. An instance of the component is extracted from the application. The extracted instance specifies values of parameters for the instance of the component. The instance can be partitioned by generating program code defining one or more kernels corresponding to the instance of the component. The partitioning is based on a defined performance metric of the component and a defined performance requirement of the application. The application is transformed by replacing the instance of the component with the program code generated by the partitioning. The application, as transformed, is compiled into program code executable by the DPE array.

Abstract: A block frequency of a block in an irreducible loop in computer code is statically determined. The statically determining includes splitting an incoming block mass among multiple loop headers of the irreducible loop to provide an initial mass for the block. A bottom-up traversal and a top-down traversal of a plurality of loops of the computer code including the irreducible loop are iteratively performed to update a mass of the block. The iteratively performing commences with propagating the initial mass of the block to one or more blocks of one or more loops of the plurality of loops and continues with propagating and updating masses of select blocks of the plurality of loops until a predefined point is reached providing a resulting mass for the block. The block frequency of the block is determined using the resulting mass and is to be used in processing associated with the computer code.

Abstract: In association with unit and integration testing of a software application, a test conflict guard can detect whether test cases are independent and use distinct database data, or are related or dependent test cases that use the same database data. The test conflict guard can detect any related or dependent test cases in a group of test cases, which may cause testing errors if executed in different parallel threads. The test conflict guard can accordingly block test execution until the group of test cases are verified as independent test cases.

Abstract: A machine learning model is trained to translate source code from one or more programming languages into a common programming language. The machine learning model translates source code from the other languages into the common programming language. A language embedder generates a vector for each function in the source code, all of which is now in the common programming language. A user provides a text search query which is converted by a language embedder to a vector. Based on the vector of the text search query and the vectors for the source code, search results are generated and presented in a user interface. Additional machine learning models may be trained and used to measure function complexity, test coverage, documentation quantity and complexity, or any suitable combination thereof. These measures may be used to determine which search results to present, an order in which to present search results, or both.

Abstract: An analysis of software stored and executing on one or more assets in an enterprise includes determining a hierarchy of nodes in the software and among the assets and analyzing dependencies among those nodes and assets through a static analysis of the software as it is stored as well as through a dynamic analysis of the software as it executes.

Abstract: Database systems and methods are provided for visual design and customization of processes for web applications. A method involves identifying a plurality of configured actions added to an aggregate action component region on a graphical user interface (GUI) display, automatically generating configured code for each of the configured actions in accordance with a respective user configuration of the respective configured action, identifying a user configuration associated with the aggregate action component, automatically generating aggregate action component code configurable to cause a browser application to initiate the configured code for each of the configured actions in parallel in accordance with the user configuration, and automatically generating process flow code including a reference to the aggregate action component code in accordance with a sequence defined for a web page.

Abstract: Mutation testing can indicate whether mutants of a software application, created by intentionally altering source code of the software application, are successfully “killed” by test cases executed against the mutants. Mutation testing can be performed via parallel threads by, within each parallel thread, modifying individual source code class files and recompiling the modified class files to generate and test mutants. Individual mutation test results produced within each of the parallel threads can be aggregated to generate an aggregated test result report that indicates overall testing metrics associated with the mutation testing across the parallel threads.

Abstract: A system and method for CI/CT/CD, which is continuous integration/continuous testing/continuous delivery, in which testing is fully integrated to the needs of rapid code development and delivery. The system is determining test coverage of a plurality of tests, comprising a code builder for providing code, a code tester for testing the code with said plurality of tests, and a code test analyzer for analyzing results of said plurality of tests to determine coverage of said code by said plurality of tests.

Abstract: Existing methods of automated testing of web service APIs require additional tools to extract API related details and configuration files to create test cases. The method and system disclosed herein taps annotations present in code of web service APIs to extract API related details and creates test cases using the extracted data. The method disclosed herein describes an approach to identify resource classes related to a plurality of web service APIs using built-in annotations in code of web application under test. Further, the identified resource classes are scanned to extract API related details (metadata) using built-in annotations and annotations given by a developer. Further, the extracted metadata is forwarded to a test engine server which generates a plurality of test cases using the extracted metadata. Further, the plurality of web service APIs are tested using the generated test cases.

Abstract: There is provided methods and apparatus to improve runtime by computer programs at compilation time. A compiler analyzes code to be translated into machine executable instructions to identify overloaded functional units of the target processor, and replaces instructions scheduled on the overloaded functional unit to an idle unit using functionally equivalent operations on the idle unit. The replacement instructions may be taken from an instruction replacement library comprising function calls that implement functionality of a functional unit of the target processor on another functional unit of the target processor.

Abstract: A system includes a processor and a memory accessible by the processor. The memory stores instructions that, when executed by the processor, cause the processor to receive an industrial automation project code file, wherein the industrial automation project code file defines one or more operations of an industrial automation system during performance of an industrial automation process, retrieve a set of industrial automation rules associated with a set of best practices for project code files, analyze the industrial automation project code file based on the set of industrial automation rules, including identifying one or more instances of inefficient tag usage, and identifying one or more sets of parallel overlapping tasks, and generate a report based the analysis of the industrial automation project code file based on the set of industrial automation rules.

Abstract: Methods, systems, and computer program products for translating clusters of a monolith application to microservices are provided herein.

Abstract: Aspects of the present disclosure relate to support content generation. An issue description is received from a user. A software feature associated with the issue description is identified using a trained classification model. A base image associated with the software feature is obtained. The base image is modified to add information indicated in the issue description, wherein the modified base image is generated support content. The generated support content is transmitted.

Abstract: A neural transformer model with attention is trained to predict candidates to complete a line of source code with a zero-inference capability. The model is trained on an unsupervised training dataset that includes features from source code written in multiple programming languages. The features include a file-level context and a local context, where the file-level context includes a global context, a class context, a function context, and/or a method context for each class, function and/or method of the source code programs used in the training dataset. The local context includes method bodies, function bodies, and/or stand-alone code of main method routines. From these features, the model is able to learn to predict an ordered sequence of code elements that complete a line of source code in a programming language seen and not seen during training.

Abstract: A software enhancement and management system (E&M System) can include two ways to decompose existing software such that new functionality can be added: functional decomposition and time-affecting linear pathway (TALP) decomposition. Functional decomposition captures the inputs and outputs of the existing software's functions and attaches the new algorithmic constructs presented as other functions that receive the outputs of the existing software's functions. TALP decomposition allows for the generation of time-prediction polynomials that approximate time-complexity functions, speedup, and automatic dynamic loop-unrolling-based parallelization for each TALP.