Search

The flattening control flow is applied through combining with opaque predicates such as chaos mapping and congruence equation algorithms. These algorithms cause a lot of extra cost. Besides, the flattening control flow combined with opaque predicate can not defense the dynamic reverse attack. In order to resolve these problems, this paper proposed to insert the redundant block, which structure was similar to basic block, and produced randomly, so that it was different to basic block. Therefore, it was difficult for attacker to differ redundant block from basic block. Then, it flattened the control flow with basic and redundant blocks, which further obfuscated the structure of control flow. Besides, it strengthened the branch variable by constructing the dynamic assignment algorithm of branch function, which improved the obfuscation resilience. This paper tested the proposed control flow obfuscation algorithm through the programs of mbed TLS from the control flow analysis, reverse engineering analysis and performance analysis. The results of test show the proposed algorithm not only improves the obfuscation potency, but also can protect the control flow information of program and resist static and dynamic reverse analysis. [ABSTRACT FROM AUTHOR]

An experiment was carried out by a group of scientists to compare different tools and techniques for detecting duplicated or near-duplicated source code. The overall comparative results are presented elsewhere. This paper takes a closer look at the results for one tool, Dup, which finds code sections that are textually the same or the same except for systematic substitution of parameters such as identifiers and constants. Various factors that influenced the results are identified and their impact on the results is assessed via rerunning Dup with changed options and modifications. These improve the performance of Dup with regard to the experiment and could be incorporated into a postprocessor to be used with other tools. [ABSTRACT FROM AUTHOR]

Many techniques for detecting duplicated source code (software clones) have been proposed in the past. However, it is not yet clear how these techniques compare in terms of recall and precision as well as space and time requirements. This paper presents an experiment that evaluates six clone detectors based on eight large C and Java programs (altogether almost 850 KLOC). Their clone candidates were evaluated by one of the authors as an independent third party. The selected techniques cover the whole spectrum of the state-of-the-art in clone detection, The techniques work on text, lexical and syntactic information, software metrics, and program dependency graphs. [ABSTRACT FROM AUTHOR]