Abstract: Generation of a set of carbon-aware test cases based on a software resource load includes receiving, by one or more processors, a source code and identifying code changes on the received source code using code analysis technology. The code changes are used to select a plurality of code snippets from the source code. The one or more processors calculate metrics associated with an energy consumption of each of the plurality of code snippets and an amount of carbon dioxide emissions equivalent to the calculated metrics. The calculated equivalent amount of carbon dioxide emissions associated with each of the plurality of code snippets is displayed by the one or more processors on the source code for automatically generating the set of test carbon-aware test cases based on the calculated amount of carbon dioxide emissions and predefined carbon emissions constraints.

Abstract: The present specification provides a method for executing a smart contract, a blockchain node, and a storage medium. An implementation of a method for executing a smart contract includes: receiving, by a blockchain node, a request for creating a smart contract, the request including a bytecode of the smart contract; starting, by the blockchain node after completing deployment of the smart contract, to compile the bytecode of the smart contract into a machine code by using ahead of time and storing the machine code; and during execution of the deployed smart contract, executing, by the blockchain node, the machine code of the smart contract in response to the machine code being locally stored. According to the above implementations of the present application, the blockchain node can greatly increase a speed of executing a smart contract, and reduce storage overheads on the blockchain node.

Abstract: A method comprises managing multiple tasks of multiple entities associated with a deployment of a software program with a deployment framework comprising a machine learning module configured to assist with managing the multiple tasks of the multiple entities. The managing step comprises tracking a status of one or more of the multiple tasks, and predicting a time taken for a given one of the multiple entities to complete a given one of the multiple tasks.

Abstract: A method, non-transitory computer readable medium and a computerized system for testing a code using real time analysis. The method can include (i) executing a group of test cases while performing real time analysis to find a set of overlapping code segments (OCSs), input values that are fed, during the executing of the group, to each one of the set of OCSs, and output values that are outputted from each one of the OCSs during the execution of the group, (ii) generating, for at least some of the OCSs, at least one OCS test for testing each of the at least some OCSs, wherein the generating is based, at least in part, on the input values and the output values, (iii) determining an evaluation process of the code that includes executing one or more OCS tests for testing one or more OCSs, (iv) evaluating the code by executing the evaluation process.

Abstract: A system includes a memory and a processor. The memory is in communication with the processor. The processor is configured to execute receiving a source code of an application that is compilable into an interpreted configuration. A database is then accessed, where the database includes a first plurality of patterns that are compilable into an interpreted configuration and fail to compile into a native compiled configuration. Within the database, a first plurality of patterns is associated with a first alternative pattern that is compilable into the interpreted configuration and compilable into the native compiled configuration. The source code is parsed to create a second plurality of patterns and analyzed with the first plurality of patterns to determine whether a corresponding pattern exists. Upon determining that the corresponding pattern exists, the corresponding pattern is added to a change list and then outputted.

Abstract: Implementations for services integration in an integrated development environment (IDE) are described. An example method may include receiving a selection of a portion of source code in an IDE, providing a list of options to perform with respect to the selected portion of the source code, the options corresponding to services external to the IDE, receiving an indication of a selected option of the options from the list, identifying an owner of the selected portion of the source code, and causing one or more functions corresponding to the selected option to be performed with respect to the selected portion of the source code and the identified owner, wherein the one or more functions are integrated into the IDE for execution.

Abstract: The invention provides a vectorized representation method of a software source code. The vectorized representation method is an AST-based neural network which is a hierarchical vector representation method comprising the following implementation steps: step 1-1, converting an original software source code into an AST at the lowest layer, and then further dividing the AST according to source code statements to acquire a smaller statement tree sequence, wherein statement trees in the statement tree sequence are different in sequence, and the statement tree sequence is consistent with an original statement sequence; step 1-2, encoding the statement trees into statement vectors e1, e2, . . .

Abstract: Provided is a system and method for providing a single entry point for integrating software extensions across different software application. In one example, the method may include receiving, via a unified extensibility entry point, an indication that a first software artifact of a first software application is being locally extended, identifying one or more other software artifacts in one or more other software applications that are capable of being cross-extended based on the local extension of the first software artifact in the first software application, and displaying, via a user interface, information about the one or more other software artifacts that are capable of being cross-extended.

Abstract: An aspect includes displaying a list of test case functions via a user interface. Each of the test case functions includes a corresponding set of instructions that is extracted from a development application, and each of the test case functions is configured to execute an atomic action with respect to a test case. The set of instructions is transparent to a user of the user interface. An aspect further includes receiving, via the user interface, a user-inputted selection of the test case functions from the list. For each test function of the selected test case functions, an aspect includes displaying, via the user interface, a field for receiving a device identifier for a device subject to the test case; receiving, via the user interface, a user-inputted device identifier; assembling the test case from the selected test case functions and the device identifier; and executing the test case for the device.

Abstract: A method includes receiving a subject-matter expert (SME) interpretable model. The method further includes converting, by a processing device, the SME interpretable model into a functional mockup unit (FMU). The method further includes integrating the FMU into a control software project (CSP). The method further includes compiling the CSP into binary code.

Abstract: An instruction may be associated with a memory address. During execution of the instruction, the memory address may be translated to a next level memory address. The instruction may also be marked for address tracing. If the instruction is marked for address tracing, then during execution of the instruction, the memory address and the next level memory address may be recorded.

Abstract: Method, apparatus and computer program product for software application update management. For example, the apparatus includes at least one processor and at least one non-transitory memory including program code. The at least one non-transitory memory and the program code are configured to, with the at least one processor, receive a qualified lifecycle command associated with a software application; in response to receiving the qualified lifecycle command, obtain an update queue flag value for the software application; determine if the update queue flag value indicates an update-queued status or an update check status; and in response to determining that the update queue flag value indicates the update check status, determine if the software application has access to a latest version of a data resource associated with the software application and adjust the first update queue flag value based on if the software application has access to the latest version.

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: A system and method for updating storage system includes a solid state disk (SSD) attached to a FPGA. The solid state disk is configured to receive a firmware image and a firmware upgrade module operating on the FPGA is configured to identify the presence of the firmware image on the SSD. The firmware upgrade module is further configured to store the firmware image in a buffer on the FPGA and write the firmware image.

Abstract: A job state machine may transition to a downloading state in response to a start message on the job pipeline, wherein the job object causes job data to be downloaded to the device when the job state machine is in the downloading state. The job state machine may transition to an installing state in response to an assertion message on the job pipeline, wherein the job object causes downloaded job data to be installed on the device when the job state machine is in the installing state. The job state machine may transition to a finished state when the job data is installed on the device. The job state machine may be recoverable to the waiting state, the downloading state, or the installing state in response to a job object failure while the job state machine is in the waiting state, downloading state, or installing state, respectively.

Abstract: The disclosed systems, apparatuses and methods are directed to optimizing by a compiler register resource allocation for functions of a module, using a Register File comprising a limited number of registers. After performing interprocedural analysis in the module, the compiler computes the number of registers used by each function, and compiles the function to final machine code, except at callsites where a call is detected to be made to another function. At each callsite and for each called function, the compiler expands call instructions to final machine code after computing and setting a relative index to be used by a called function for running in an available part of the Register File. The relative index optimizes register resource allocation by minimizing the number of spilled registers before a function is called.

Abstract: Apparatuses, methods, program products, and systems are presented for interrupt virtualization. An apparatus includes an adapter module that detects a switch from a first physical input/output (“I/O”) adapter associated with a logical partition to a second physical I/O adapter associated with the logical partition. The apparatus includes an interrupt module that updates one or more I/O interrupt management structures for the logical partition so that the logical partition receives I/O interrupt information from the second physical I/O adapter and not the first physical I/O adapter without the logical partition being aware of the switch to the second I/O adapter. The apparatus includes an abstraction module that updates physical device information at a hypervisor for the logical partition to reflect the switch to the second physical I/O device.

Abstract: Disclosed herein are system, method, and device embodiments for optimizing uploads for an offline scenario by merging requests. An embodiment operates by performing a plurality of modification operations over application storage, generating a first queue entry within a normal operations queue corresponding to a first modification operation of the plurality of modification operations, generating a second queue entry corresponding to a second modification operation of the plurality of modification operations, generating an optimized operations queue including an optimized queue entry combining the first queue entry and the second queue entry, and synchronizing the application storage with a remote storage system based on the optimized operations queue.

Abstract: A method, computer system, and computer program product for determining a candidate patch for computer software is provided. According to a method, fingerprint(s) of patch(es) for a computer software is obtained first, wherein a fingerprint of a patch comprises function(s) being revised in the computer software if the patch is installed into the computer software. Then whether every function in the obtained fingerprint(s) of patch(es) has been called is monitored in response to beginning of execution of the computer software along to code path(s) related to bug(s). And at last candidate patch(es) is determined in response to end of the execution of the computer software along to the code path(s) related to the bug(s), wherein every function in the fingerprint of the candidate patch(es) has been called during the execution of the computer software.

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.