Abstract: At least one ALM artifact, indexed by a unified data store, that does not comply with at least one process convention can be identified. Responsive to identifying the ALM artifact, indexed by the unified data store, that does not comply with the process convention, a determination can be made by a process convention agent executed by a processor as to whether script code is available to update the ALM artifact to comply with the process convention. Responsive to the process convention agent determining that script code is available to update the ALM artifact to comply with the process convention, the process convention agent can automatically execute the script code to update the ALM artifact to comply with the process convention.

Abstract: At least one ALM artifact, indexed by a unified data store, that does not comply with at least one process convention can be identified. Responsive to identifying the ALM artifact, indexed by the unified data store, that does not comply with the process convention, a determination can be made by a process convention agent executed by a processor as to whether script code is available to update the ALM artifact to comply with the process convention. Responsive to the process convention agent determining that script code is available to update the ALM artifact to comply with the process convention, the process convention agent can automatically execute the script code to update the ALM artifact to comply with the process convention.

Abstract: In one example of the disclosure, code lines for a software program are received, the code lines including a unit of code lines. Code entities within the unit are identified. Each code entity includes a line or consecutive lines of code implementing a distinct program requirement or defect fix for the program. Context changes are identified within the unit, each context change including an occurrence of a first code line set implementing an entity, adjacent to a second code line set implementing another entity, within a same code scope. A code complexity score is determined based upon counts of entities identified and context changes identified within the unit, and upon counts of code lines and entities within the program.

Abstract: A computing system comprises, in one example, an upgrade system configured to detect a user upgrade input indicating that a base version of a computing system is to be upgraded, by applying a set of upgrade changes to the base version, to obtain an upgraded version of the computing system, a difference generation system configured to retrieve a customized version of the base version of the computing system and identify that the customized version corresponds to the base version with customizations applied, a combining engine configured to obtain the customizations applied to the base version and the upgrade changes, and combine the customizations with the upgrade changes to obtain a full set of changes, and a difference application engine configured to apply the full set of changes to the base version of the computing system to obtain a customized, upgraded version of the computing system.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving source code and an indication that a portion of the source code is insecure. Receiving an annotation to the source code that identifies the indication as being a false positive indication. The annotation includes a logical statement showing that the portion of the source code is not insecure, where the logical statement can be executed by a processor to prove that the portion of the source code is not insecure. Processing the annotation to determine whether the logical statement proves that the portion of the source code is not insecure. In response to determining that the logical statement proves that the portion of the source code is not insecure, retaining the annotation in the source code, and removing the indication that the portion of the source code is insecure.

Abstract: A vehicle-mounted program writing device includes a plurality of vehicle-mounted control devices and a relay device. If a write start command button is turned on when a memory storage completion indicator is in an on state, the relay device starts the writing of the updated programs and the updated data to the vehicle-mounted control devices. If the memory storage completion indicator is in off state, the relay device does not execute the writing of the updated programs and the updated data even when the write start command button is turned on.

Abstract: A method for link time optimization comprises parsing, by a compiler, an intermediate representation file to determine what symbols are present in the intermediate representation file. The method comprises providing the symbols to a linker and creating, by the linker, a symbol use tree of all the symbols that are present in the intermediate representation file and other symbols in binary code received by the linker. The method further comprises discarding, by the linker, any received objects for which no use can be identified and all dependencies of the objects. The method includes providing, from the linker to the compiler, a preserve list of symbols, the preserve list comprising a list of symbols proven used by the objects and the intermediate representation files. The method comprises compiling the intermediate representation files and the objects based on the preserve list of symbols, and deleting, by the linker, any remaining unused objects.

Abstract: A method for executing program builds comprising: analyzing file dependency information and job duration information associated with jobs of the program build; scheduling jobs for a current program build based on the analysis of the dependency information and the job duration data; executing the jobs according to the schedule; collecting file usage information and new job duration information from each of the jobs; supplementing the file dependency information with the file usage information; and storing the new job duration information to be used for scheduling jobs in subsequent program builds.

Abstract: The desktop data of a first mobile terminal may be acquired. Then, a local folder is created for a terminal application according to a desktop layout file in the desktop data, and an identifier is set. A mapping relationship between identifiers of new and original folders is established. Then, an installation package of the terminal application is traversed to determine whether the terminal application is installed locally. If yes, a local folder to which the terminal application belongs is determined according to the mapping relationship, installation information of the terminal application is placed in the determined local folder, and an icon of the terminal application is displayed at a corresponding location on a local desktop according to location information of the terminal application.

Abstract: Disclosed is a method and an apparatus for incremental upgrade. When a server generates an incremental file, it acquires sub-files of different types in an old version compressed file and a new version compressed file, and performs different difference comparison steps on the sub-files of different types, to obtain difference data files for corresponding types: for sub-files that satisfy a preset decompression condition, a decompression comparison method is used to perform difference comparison, and for sub-files that do not satisfy the preset decompression condition, a direct comparison method is used to perform difference comparison; subsequently, a client acquires the difference data files from the server, and according to the type of a difference data file, carries out a merge operation on the difference data file and the old version compressed file to obtain the new version compressed file.

Abstract: Recording a replay-able trace of execution of an executable entity using cache data includes executing one or more threads of the executable entity concurrently across one or more processing units of the one or more processors. During execution of the one or more threads, a separate replay-able trace is recorded for each thread independently. Recording includes, for each thread, recording initial processor register state for the thread. Recording also includes, for each thread, and upon detecting a processor data cache miss, recording at least one line of cache data imported into the processor data cache.

Abstract: A method of setting retransmission time of an application client during virtual machine migration includes predicting migration memory size required by a virtual machine to be migrated based on historical access log of at least one application and memory log of the virtual machine to be migrated; computing available migration bandwidth of a host of the virtual machine to be migrated; computing virtual machine migration time based on the predicted migration memory size required by the virtual machine to be migrated and the available migration bandwidth of the host; and setting retransmission time of the application client based on the virtual machine migration time.

Abstract: A processor-implemented method, system, and/or computer program product generates and implements intuitively comfortable frames of task appropriate frames of reference for multiple dimensions of context constraints for related sets of objects within an integrated development environment (IDE). One or more processors identify a hierarchical set of context constraints for an object, and depict the hierarchical set of context constraints for the object on an IDE using a visual metaphor selected by a user. The processor(s) receive a zoom-in input for a first context constraint in the hierarchical set of context constraints, and place the IDE in mention mode, such that use of the hierarchical set of context constraints against the object is disabled. In response to the IDE being placed in mention mode, the processor(s) display detail of the first context constraint on the IDE, and receive changes to the first context constraint to create a modified first context constraint.

Abstract: System and method for validating a program under a specified model of computation. The model of computation may be related to the synchronous statechart model of computation. A program may be received that specifies a plurality of operations using a variable within a logical tick such that the variable has multiple values within the logical tick. The program may be statically analyzed according to a specified model of computation that specifies program execution based on logical ticks, which may include determining that the program has deterministic semantics that specify deterministic results for each logical tick during execution of the program, including specifying deterministic results of the plurality of operations performed within the logical tick. The program may be validated in accordance with the specified model of computation in response to the determining. Such techniques may allow validation of a larger set of programs than conventional models while maintaining deterministic results.

Abstract: An apparatus for testing applications includes a data-processing machine including a memory and a processor operably coupled to the memory. The data-processing machine is configured to implement a data-driven testing framework that includes a data engineering module, a computational environment manager, and a result analysis module. The data engineering module is configured to create engineered test data based at least in part on the application to be tested. The computational environment manager is configured to control a computational environment in which the application is to operate on the engineered test data. The result analysis module is configured to compare engineered test data operated upon by the application with an expected output.

Abstract: Embodiments of the present invention provide methods, computer program products, and systems for optimizing virtual calls. Embodiments of the present invention can be used to receive a virtual call associated with a first implementation method and identify a virtual call associated with a second implementation method that appears to have similar functionality to the first implementation method. Embodiments of the present invention can determine whether the virtual call associated with the first implementation method and the virtual call associated with the second implementation method produce the same result and, responsive to determining that the virtual call associated with the first implementation method and the virtual call associated with the second implementation method produce the same result, use a result of the virtual call associated with the first implementation method as a result of the virtual call associated with the second implementation method.

Abstract: A system, a method, and a computer program product for deploying objects are disclosed. A file containing a plurality of artifacts for deploying during runtime of an application is defined. At least one dependency for at least one artifact in the plurality of artifacts is determined based on the defined file. A database object for implementation during runtime of the application is created based on the determined dependency. At least one change to the database object during runtime of the application is implemented. The artifact is deployed during runtime of the application based on the implemented change to the database object.

Abstract: An example method includes, during execution of a software application in a computing system comprising a plurality of processing units, identifying platform-independent instructions that are configured to perform at least one computational task, wherein the plurality of processing units comprises a heterogeneous group, and wherein the platform-independent instructions have a format that is not specific to any particular processing unit in the plurality of processing units, determining one or more scheduling criteria that are associated with the platform-independent instructions, and selecting, from the heterogeneous group of processing units and based on the scheduling criteria, a processing unit to perform the at least one computational task.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for identifying network security risks. One of the methods includes receiving organizational hierarchy data and receiving access privilege data for a network, generating an adjacency matrix that represents connections between individuals within the organizational hierarchy and various groups, and that represents connections between the individuals and various access privileges, selecting an analytic technique for analyzing the adjacency matrix, determining, for each individual, an individual score that represents a security risk associated with the individual's network account, and in response to determining that the individual score meets a threshold, applying security controls.

Abstract: The method includes identifying a test report log for a regression test. The method further includes identifying one or more errors in the identified test report log. The method further includes determining a severity category for the one or more identified errors in the identified test report log. The method further includes determining a severity category for the identified test report log based on the determined severity category for the one or more identified errors in the identified test report log.