A method and apparatus are disclosed for enhancing operable functionality of input source code files from a software program by identifying a first code snippet and a first library function which generate similar outputs from a shared input by parsing each and every line of code in a candidate code snippet to generate a templatized code snippet data structure for the first code snippet, and then testing the templatized code snippet data structure against extracted library function information to check for similarity of outputs between the first code snippet and the first library function in response to a shared input so that the developer is presented with a library function recommendation which includes the first code snippet, the first library function, and instructions for replacing the first code snippet with the first library function.

Embodiments described herein provide a solution for optimizing a compiling of program code. A proposed state pointer, which corresponds to a current state pointer to a current state node that represents a section of the program code, is added in an intermediate language (IL) representation of the program code. When the optimizing compiler determines that an optimization should be made to a section of code, the current state node is copied to create a proposed state node, which is then referenced by the proposed state pointer. The proposed state node is edited to include the optimization while the current state node remains unchanged. The success of the optimization is evaluated, and an updated IL representation is generated in which any references to nodes that are no longer included in the flow of the former IL representation are removed.

A system and method for providing and executing a domain-specific programming language for cloud services infrastructure is provided. The system may be used to integrate references to external entities, such as cloud service compute instances, directly into a domain-specific programming language, allowing developers to easily integrate cloud services directly using the domain-specific programming language. The domain-specific programming language may also allow users to declare strategies for a given computing system rather than specific instances of computing infrastructure. The strategies can be resolved by an artificial intelligence engine to determine an optimal computing instance solution to the user declared strategy. The determined solution from the artificial intelligence engine can be used to generate a computing system on a cloud service provider account.

A method for generating a technical system model executable on a test unit, wherein the test unit and the executable model are designed for real-time-capable testing of a control unit connected to the test unit, and wherein the executable model is constructed from a plurality of executable submodels communicating with each other, wherein each executable submodel has a separate address space and/or is executed on a separate processor or separate processor core when a test of a control unit connected to the test unit is being run.

In some examples, method includes, in response to receiving an initial user input that causes a builder computing system to compile a set of source code into a set of compiled targets of an application package that implements an application, deploying the application package to initiate execution of the application, wherein a subset of the set of source code is compiled into an initial subset of the set of compiled targets; after modification to at least the subset of the set of source code, receiving a subsequent user input that causes the builder computing system to compile at least the subset of the set of source code into an updated subset of the set of compiled targets; and deploying the updated subset to update the application based on the updated subset without sending another application package that includes the updated subset.

In a method of compiling an updated program having a plurality of updated functions that is updated from an original program having a plurality of original functions, it is determined whether a first original function corresponding to a first updated function exists, it is determined whether the first updated function is changed from the first original function, a first optimization combination for the first updated function is searched when the first original function does not exist or when the first updated function is changed from the first original function, a second optimization combination applied to the first original function is read from a configuration database storing optimization combinations for the original functions when the first original function exists and the first updated function is not changed from the first original function, and the updated program is compiled using the first optimization combination or the second optimization combination.

A method for executing a dynamically generated operation in a parallel processing framework may include executing the dynamically generated operation sequentially for a threshold quantity of times before initiating a compilation operation to generate precompiled code for the dynamically generated operation. Upon generating the precompiled code, execution of the precompiled code may be parallelized by determining, based on a quantity of time required to execute the precompiled code on a portion of a dataset, a task size. The execution of the precompiled code may be divided, based on the task size, into one or more tasks. Moreover, a corresponding quantity of worker threads may be allocated to perform the one or more tasks in parallel. Related methods and computer program products are also provided.

A software developer tool allows for live code updates (LCU) while an application is running using an execution platform. The LCU update service operates by preemptively, automatically rewriting bytecode to introduce a layer of indirection that swaps out the code of a running application to make it easy to dynamically update whenever the code is changed. The indirection includes both new representation classes (and constituent fields and methods), and also replacing constructs that are hard-coded into the bytecode with more flexible constructs such as representation object maps and a dynamic global class table. All manner of code modifications are handled including adding, removing and modifying fields and methods of classes, and changing the class hierarchy. This includes arbitrary code changes, ensuring that when a developer changes a class, all objects of or related to that class are instantly updated.

A software developer tool allows for live code updates (LCU) while an application is running using an execution platform. The LCU update service operates by preemptively, automatically rewriting bytecode to introduce a layer of indirection that swaps out the code of a running application to make it easy to dynamically update whenever the code is changed. The indirection includes both new representation classes (and constituent fields and methods), and also replacing constructs that are hard-coded into the bytecode with more flexible constructs such as representation object maps and a dynamic global class table. All manner of code modifications are handled including adding, removing and modifying fields and methods of classes, and changing the class hierarchy. This includes arbitrary code changes, ensuring that when a developer changes a class, all objects of or related to that class are instantly updated.

A set of source files is stored in a shared storage repository for nodes of a distributed computing environment for software compilation. An object file is created based on at least a portion of the set of source files. A directed acyclic graph (DAG) is generated corresponding to a group of software build tasks and the relationship between the software build tasks based on the set of source files. A replication factor for the object file is determined based on the number of relationships of the object file identified from the DAG. The object file is stored in a local memory cache of at least one of the number of the nodes, wherein the number of the nodes is based on the replication factor for the object file.