Abstract: Methods and systems are described for removing branches from a computer program. The system receives code for a computer program, with the code including a number of branches. Each branch is part of a branching path and includes a jump instruction. The system executes the code, and upon encountering a branching path at runtime, the system proceeds with a number of steps. First, the system computes the result of the branch, then prefetches independent instructions outside of the branch to be executed. The system then executes one or more of the prefetched independent instructions and removes an if statement within the jump instruction of the branch at the computed result of the branching path. The system then executes the jump instruction of the branch at the computed result of the branching path.

Abstract: Methods, systems, and devices are provided for detecting spam filtering. According to one aspect, the system can inject, by a server, into a client email campaign a plurality of emails for transmission to a plurality of seed email addresses separate from a plurality of non-injected emails of the client email campaign for transmission to a plurality of target email addresses. The system can detect whether the one or more injected emails were categorized as spam or not spam by each of the plurality of seed email addresses and generate a first input to an analysis module. The system can monitor a plurality of sensing signals from the non-injected emails and generate a second input to the analysis module. The analysis module can predict based on the first input and second input whether the non-injected emails are categorized as spam by the target email addresses.

Abstract: Methods and systems are described for removing branches from a computer program. The system receives code for a computer program, with the code including a number of branches. Each branch is part of a branching path and includes a jump instruction. The system executes the code, and upon encountering a branching path at runtime, the system proceeds with a number of steps. First, the system computes the result of the branch, then prefetches independent instructions outside of the branch to be executed. The system then executes one or more of the prefetched independent instructions and removes an if statement within the jump instruction of the branch at the computed result of the branching path. The system then executes the jump instruction of the branch at the computed result of the branching path.

Abstract: Methods and systems describe providing a compilable machine code program from dynamic language code. First, the system receives a computer program consisting of code in a dynamic language. For each dynamic instruction within the code, the system: identifies all function calls within the code which may call the dynamic instruction; generates a super slice callgraph for all identified function calls for the dynamic instruction, including dependency relationships for instance variables and static variables within time constraints; and generates a set of slices for the dynamic instruction. The system then compiles and executes each slice to identify one or more values for each dynamic instruction. Next, the system updates the computer program such that each of at least a subset of the dynamic instructions is replaced with machine code instructions based on the corresponding values.

Abstract: Methods, systems, and devices are provided for detecting spam filtering. According to one aspect, the system can inject, by a server, into a client email campaign a plurality of emails for transmission to a plurality of seed email addresses separate from a plurality of non-injected emails of the client email campaign for transmission to a plurality of target email addresses. The system can detect whether the one or more injected emails were categorized as spam or not spam by each of the plurality of seed email addresses and generate a first input to an analysis module. The system can monitor a plurality of sensing signals from the non-injected emails and generate a second input to the analysis module. The analysis module can predict based on the first input and second input whether the non-injected emails are categorized as spam by the target email addresses.

Abstract: A system and method for automatic parallelization of computer code includes: measuring a performance of a computer program; identifying slow code of the computer program; implementing a computer code analysis of the computer program including: implementing a dependence analysis; implementing a side effect analysis of the computer program; constructing a dependency analysis basic block (DABB) graph for blocks of the code: a graphical representation of one or more possible paths through a respective disparate block of code; constructing a versioned dependency graph that optimizes a performance of the computer program; generating a metaprogram based on the versioned dependency graph; and automatically executing parallelization of the computer program at runtime based on the metaprogram.