Program comprehension is one of the most important applications in decompilation. The more abstract the decompilation result the better it is understood. Intrinsic function is introduced by a compiler to reduce the overhead of a function call and is inlined in the code where it is called. When analyzing the decompiled code with lots of inlined intrinsic functions, reverse engineers may be confu...

Metrics plays an important role in the software modularization. Several metrics have been discussed so far. This paper describes a metrics based on control structures which is a minor modification of McCabe’s approach. Proposed novel approach is a control structure based complexity (CSBC) which is used to compute the complexity by counting the control structures directly from the source code ra...

Model or specification based intrusion detection systems have been effective in detecting known and unknown host based attacks with few false alarms [12, 15]. In this approach, a model of program behavior is developed either manually, by using a high level specification language, or automatically, by static or dynamic analysis of the program. The actual program execution is then monitored using...

Machine SUIF 6] is an extension of the SUIF compiler framework that facilitates experiments with machine-speciic optimizations. Just as base SUIF 7] is built on a rich collection of libraries for machine-independent analysis and transformation, machine SUIF has a growing set of libraries for working at the machine level. This note is about the libraries for ow analysis to support ow-directed tr...

Search-based optimization techniques have been utilized for a number of software engineering activities. The representation of the problem and the definition of the fitness function (FF) are two key ingredients for the application of search-based optimization to software engineering problems. Therefore, a well-defined fitness function is essential to the effectiveness and efficiency of the sear...

Abstract The security of smart contract has always been one the significant problems in blockchain. As shown previous studies, vulnerabilities contracts can lead to unpredictable losses. With rapid growth number contracts, more and data driven detection technologies based on machine learning have proposed. However, some state‐of‐the‐art approaches mainly rely source code contract. These methods...

A variety of applications have arisen where it is worthwhile to apply code optimizations directly to the machine code (or assembly code) produced by a compiler. These include link-time whole-program analysis and optimization, code compression, binaryto-binary translation, and bit-transition reduction (for power). Many, if not most, optimizations assume the presence of a control-flow graph (cfg)...

We propose a precise and efficient pipeline analysis to tackle the problem of out-of-order resources in modern embedded microprocessors for computation Worst-Case Execution Time (WCET). Such are prone timing anomalies 1. To remain sound, must either rely on huge over-estimations or consider all possible states which usually leads combinatorial blowup. cope with this situation, we build an compu...

Third-party software is often distributed only in binary form. For software engineering or security considerations, it is important to be able to analyze binaries. One fundamental obstacle to perform binary analysis is the lack of precise control flow information. Existing techniques to construct control flow of binaries are either static or dynamic. Traditional static techniques usually disass...

The Size-Change Termination technique is based on a program abstraction for which termination is decidable. Termination is verified by a set of local termination proofs that account for all cycles in a control-flow graph. We present algorithms that construct a global ranking function for an SCT instance. Such functions serve as easy-to-check witnesses for termination, and are therefore interest...