Abstract: A system and method for automatically optimized statistical analysis by computer is disclosed. Given a programmatic definition of the data model, the system generates, manages, and interfaces optimized computer code for use by higher level client applications. The method by which the computer generated code is transparently compiled and linked for remote access by clients provides near peak numerical efficiency without any human optimization in the client space. The configuration of model subsystems is designed to allow flexible general purpose analytics as well as specialized machine learning through optimizing feedback mechanisms.

Abstract: Methods and apparatuses are described for testing a modified version of a software application. A recorder module stores production incoming messages received by the software application and associated timing data; production outgoing messages sent by the software application and associated timing data; a sequence of random number values and associated timing data; and a plurality of production event registrations by the software application and associated dispatch timing data based on an actual dispatch time associated with the production event registration.

Abstract: In at least one embodiment, a system for facilitating installation of a software application is provided. The system includes a communications component configured to communicate with external devices, and a processor configured to detect an intent to install the software application to a computing device, cause the communications component to provide an installer of the software application for retrieval by the computing device, and direct the communications components to communicate with a mobile device such that the mobile device serves as a guide in installation of the software application to the computing device.

Abstract: A framework for enabling mobile functionality in a web application (App) to produce a mobile enabled App is described herein. In accordance with one aspect, a web App and a configuration file is provided to a mobile application (mApp) enabler. The configuration file contains configuration information for mobile enablement. The mApp enabler changes a project structure of the web App to a mobile structure and inserts bootstrap codes into the web App. The bootstrap codes load plugins for mobile devices. Codes to handle events available on mobile devices may be inserted, and data sources for the web App may be converted to data sources for a mobile enabled App to enable the web App for mobile (mobile enabled web App).

Abstract: Systems and methods for making source code annotations available across software code repository commits are disclosed. An example method for creating an incremental blame structure for determining which annotations should be shown begins with receiving a commit including at least one file that has been updated with respect to a parent commit. Then, parent file revisions for the at least one file should be identified. An example method determines the differences between the at least one file and the identified parent file revisions and traces an origin of each line in the file based on the determined differences. An identifier of the line and the line's origin may be added to the incremental blame data structure of the file.

Abstract: A method comprising of analyzing and transforming a program executable at compile-time such that a processor design objective is optimized. A method including analyzing an executable to estimate energy consumption of an application component in a processor. A method including transforming an executable to reduce energy consumption in a processor. A processor framework controlled by compiler inserted control that statically exposes parallelism in an instruction sequence. A processor framework to reduce energy consumption in an instruction memory system with compiler inserted control.

Abstract: In one embodiment, a computer-implemented method includes tracking a size of a load-store queue (LSQ) during compile time of a program. The size of the LSQ is time-varying and indicates how many memory access instructions of the program are on the LSQ. The method further includes scheduling, by a computer processor, a plurality of memory access instructions of the program based on the size of the LSQ.

Abstract: A method for accelerating processing of program code in a heterogeneous system may be provided. It may include identifying at runtime a code region having an acceleration potential, creating a dependency graph of the program code, expanding the dependency graph based on a first set of predefined rules to generate variants of the code region, and determining segments within the variants based on a second set of predefined rules. The segments may be dedicated and assigned and compiled for use to/by a specific execution unit such that a cost function is minimized.

Abstract: A method for accelerating processing of program code in a heterogeneous system may be provided. It may include identifying at runtime a code region having an acceleration potential, creating a dependency graph of the program code, expanding the dependency graph based on a first set of predefined rules to generate variants of the code region, and determining segments within the variants based on a second set of predefined rules. The segments may be dedicated and assigned and compiled for use to/by a specific execution unit such that a cost function is minimized.

Abstract: In one embodiment, a computer-implemented method includes tracking a size of a load-store queue (LSQ) during compile time of a program. The size of the LSQ is time-varying and indicates how many memory access instructions of the program are on the LSQ. The method further includes scheduling, by a computer processor, a plurality of memory access instructions of the program based on the size of the LSQ.

Abstract: A method for optimizing if statements in a program includes obtaining, by a processing device, for each of conditional expressions of a plurality of if statements in the program, a set of conditional expressions having an inclusion relation; computing, for each of the set, a position with low execution frequency in the program as a move destination of a conditional expression having an inclusion relation, using information of the set in which the conditional expression is included; and moving the conditional expression to the computed move destination of the conditional expression.

Abstract: A method for optimizing if statements in a program includes obtaining, by a processing device, for each of conditional expressions of a plurality of if statements in the program, a set of conditional expressions having an inclusion relation; computing, for each of the set, a position with low execution frequency in the program as a move destination of a conditional expression having an inclusion relation, using information of the set in which the conditional expression is included; and moving the conditional expression to the computed move destination of the conditional expression.

Abstract: Systems and methods are provided for regular expression support in instrumentation languages using kernel-mode executable code. An example system includes a translator module that receives an input source code including a regular expression in a first source code language, wherein the translator module further determines a matching function in kernel-mode code language corresponding to the regular expression, and wherein the matching function corresponds to deterministic finite automaton. The system further includes a kernel module that processes at least one string using the matching function, wherein the matching function simulates state transitions of the deterministic finite automaton using the at least one string.

Abstract: A method to customize an online software application. The method includes displaying, using a user interface of the online software application, a message inviting user contribution to a customizable component of the online software application, receiving, from an initial seed user via a network connection and in response to displaying the message, a structural specification of the customizable component suggested by the initial seed user according to a requirement based on an attribute of the initial seed user, determining that a new user of the online software application matches the attribute of the initial seed user, and configuring, based on the structural specification of the customizable component suggested by the initial seed user, an instantiation of the online software application for the new user to perform a pre-determined task according to the requirement.

Abstract: The various embodiments herein provide a system and method for identifying, analyzing and integrating the risks associated with a source code. The system comprises a code coverage module for collecting and transforming the code coverage information by a file name, a source code analyzer module for collecting and transforming source code violations information by the file name, a software configuration management module for collecting and transforming the source code commit information by the file name, a risk analyzer processing module for receiving and relating the collected code coverage information, source code violations information and source code commit information with each other by the file name and a report generation module for publishing the processed result of the collected code coverage information, source code violations information and source code commit information in a report. The report is reviewed for identifying, analyzing and integrating risks associated with source code.

Abstract: Various embodiments are directed to a computer implemented method for determining a largest common series of statements from one or more sets of ordered statements. A most common statement in the one or more sets of ordered statements is determined. A first order most common sequential statement following each most common statement is determined. The most common statement and the first order most common sequential statement are stored in a data object as the largest common series.

Abstract: A computer program obfuscating system including a processor to provide a computer program including at least one computer program variable, and add an opaque predicate to the computer program to obfuscate the computer program so that the opaque predicate added to the computer program comprises at least one polynomial including a polynomial P, during execution of the obfuscated computer program, the polynomial P is evaluated yielding at least one result including a first result R1, and during execution of the obfuscated computer program, the opaque predicate is evaluated based on the at least one result R1 such that a decision as to whether or not to perform the first command is dependent upon comparing the first result R1 to at least one value in accordance with a predetermined mathematical relationship. Related apparatus and methods are also included.

Abstract: A method for optimizing if statements in a program includes obtaining, by a processing device, for each of conditional expressions of a plurality of if statements in the program, a set of conditional expressions having an inclusion relation; computing, for each of the set, a position with low execution frequency in the program as a move destination of a conditional expression having an inclusion relation, using information of the set in which the conditional expression is included; and moving the conditional expression to the computed move destination of the conditional expression.

Abstract: A method for optimizing if statements in a program includes obtaining, by a processing device, for each of conditional expressions of a plurality of if statements in the program, a set of conditional expressions having an inclusion relation; computing, for each of the set, a position with low execution frequency in the program as a move destination of a conditional expression having an inclusion relation, using information of the set in which the conditional expression is included; and moving the conditional expression to the computed move destination of the conditional expression.

Abstract: Disclosed are a method and a system for facilitating verification of program code implementing Sleep Wakeup protocol for a microcontroller. An input handling module is configured to receive metadata from user required for verification of the program code. Identification module is configured to identify abstract syntax tree (AST) nodes corresponding to each program point in the program code. A computation module is configured to compute an actual interrupt protection status (IPS), task lock status (TLS), path entities and shared variables for each program point in the program code. A path analysis module is configured to determine transition paths between program points specified in the metadata, and are computed in terms of the path entities. Also, review information is computed for each of the path entities comprised in the transition paths. Further, a report generation module is configured to generate a report comprising the review information facilitating the user to verify the program code.