Abstract: A source code correction assistance apparatus is configured to include a storage device that stores an updated source code, and an arithmetic operational device that generates, as an evaluation code template of the updated source code, a template including a conditional branch sentence related to each case of success or failure of an input condition, notifies an evaluator terminal of a request to create an evaluation code based on the template, controls an access to the updated source code by the evaluator, receives editing by the evaluator on the conditional branch sentence in the template, generates a list of input values for executing all control paths of the evaluation code after the editing, and generates an evaluation code driver that automatically executes the evaluation code by inputting the input value.

Abstract: Methods, apparatuses, systems, computing entities, and/or the like are provided. An example method may include retrieving software development data associated with a software application; receiving modular configuration data from a client system; determining application usage data based at least in part on a user profile of the client system that is associated with the software application; generating a release note data object based at least in part on at least one of the software development data, the modular configuration data, and the application usage data; and performing one or more software application release operations by transmitting the release note data object to the client system.

Abstract: A sample ratio mismatch (SRM) analyzer receives data from an online controlled experiment (OCE) and provides information to help determine a root cause of an SRM. The SRM analyzer may identify one or more segments in the data that include an SRM and may determine whether a triggered scorecard of the OCE includes an SRM. The data may include one or more scorecards. The SRM analyzer may determine whether each scorecard has an SRM. The SRM analyzer may test a difference in proportion of users assigned to treatment between a last scorecard without an SRM and a first scorecard with an SRM. If the difference in proportion is statistically meaningful, the SRM analyzer may determine that the SRM arose after the last scorecard. If the difference in proportions is not statistically meaningful, the SRM analyzer may determine that the SRM existed from a beginning of the OCE.

Abstract: A method includes receiving source code of a program to be compiled and compiling the source code of the program. Compiling the source code includes identifying a first function in the source code of the program that is a candidate to be executed by a graphics processing unit (GPU), generating a first intermediate representation and a second intermediate representation for the first function, and inserting a second function in the program in place of the first function, wherein the second function is to select one of the first intermediate representation or the second intermediate representation to be executed. The method further includes providing a compiled program package including the second function, the first intermediate representation and the second intermediate representation.

Abstract: In programming environments, an object can be extended by adding a new property (subroutine) to the collection of the object properties. The properties of the object can be accessed using property access syntax. Extension property call is an innovation which allows the use of an object together with property access expression to access the properties (subroutines) that are not contained in the object itself, but which are contained in another object and are visible in the scope where the property access expression is used. The extension properties do not have special extension property definition syntax. Any regular property (subroutine) can be used as the extension property of the object if the property is visible in the scope where the property access expression is used. Extension property calls makes programming language code concise, improving code readability.

Abstract: A deep learning model trained to learn to predict source code is tuned for a target source code generation task through reinforcement learning using a reward score that considers the quality of the source code predicted during the tuning process. The reward score is adjusted to consider code-quality factors and source code metrics. The code-quality factors account for the predicted source code having syntactic correctness, successful compilation, successful execution, successful invocation, readability, functional correctness, and coverage. The source code metrics generate a score based on how close the predicted source code is to a ground truth code.

Abstract: A system and a method for performing a test of an application using an automation bot are provided. The method comprises accessing the application to be tested. The method comprises executing the test of the application using the automation bot. The automation bot is configured to interact with one or more other applications. The one or more other applications are different from the application. The method comprises determining one or more test results of the application based on the execution of the test. Further, the method comprises generating a notification indicative of the determined one or more test results.

Abstract: Early exit of a loop is performed. A determination is made as to whether a loop within computer code reaches a fixed point of processing, which is predefined. Based on determining that the loop reaches the fixed point of processing, at least one indication is included in the loop to perform an early exit of the loop prior to a last iteration of the loop.

Abstract: Software systems and methods convert algorithms and software codes into time affecting linear pathways (TALPs) via decomposition and convert paired Input/Output (I/O) datasets into TALPs via Value Complexity polynomials. Generated TALPs can be enhanced through merging with other TALPs. TALPs can be grouped by matching the outputs of the TALP-associated prediction polynomials with some set of given criteria into families and cross-families that are useful in a new type of software optimization that allows for output values of grouped TALPs to be modeled, pooled, discretized and optimized to enhance goals or meet user goals.

Abstract: Aspects of the present disclosure relate to personalized software release note generation. Software usage of a user with respect to a software application can be tracked. Software release notes of the software application can be analyzed with respect to the software usage. Personalized software release notes can be generated for the user based on the analyzing. The personalized software release notes can be presented to the user.

Abstract: A system and method for identifying and removing dead-code from a computer program of an independent service is provided. The method includes: retrieving information related to the code of the service, wherein the retrieved information includes at least static and dynamic dependencies information of classes of the service; constructing a static dependencies graph, wherein nodes of the static dependencies graph are classes, and directed edges depict static dependencies between classes; classifying classes based on the static dependencies; constructing a first subgraph to include classes classified as internal-pure-static (IPS) classes; detecting external-dead-class candidates by traversing the subgraph; adding external-dead-class candidates to a dead code cut (DCC) set; and removing at least one class included in the DCC set from the code of the service.

Abstract: An example operation may include one or more of sending, by a master transport, a first portion of a software update to a transport of a first subset of transports, sending, by a master transport, a second portion of the software update to a transport of a further subset of transports, when a first transport of the subset of the transports and a second transport of the further subset of the transports are in proximity, causing the first transport to send the first portion of the software update to the second transport, and causing the second transport to send the second portion of the software update to the first transport.

Abstract: A method for managing an information technology infrastructure is provided. The method may include generating a workspace configured to maintain configurations for the information technology infrastructure. A configuration file specifying configurations to apply to the information technology infrastructure may be merged into the workspace. An execution plan may be generated based on the workspace. The execution plan may include operations to apply, to the information technology infrastructure, the configurations specified in the configuration file. The configurations may be applied, based on the execution plan, by at least provisioning, modifying, and/or de-provisioning one or more resources at the information technology infrastructure. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: An application development and deployment system allows an application developer to develop applications for a distributed data intake and query system. The application may include information that associates portions of the application with particular server groups of the distributed data intake and query system. The application may be partitioned to generate target application packages for each of the server groups of the data intake and query system.

Abstract: Software systems and methods convert algorithms and software codes into time affecting linear pathways (TALPs) via decomposition and convert paired Input/Output (I/O) datasets into TALPs via Value Complexity polynomials. Generated TALPs can be enhanced through merging with other TALPs. TALPs can be grouped by matching the outputs of the TALP-associated prediction polynomials with some set of given criteria into families and cross-families that are useful in a new type of software optimization that allows for output values of grouped TALPs to be modeled, pooled, discretized and optimized to enhance goals or meet user goals.

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.