As software is used in various areas today, software security has become a crucial issue. Third-party libraries, which play a major role in software development, pose difficulties in analyzing and testing software sec...
详细信息
As software is used in various areas today, software security has become a crucial issue. Third-party libraries, which play a major role in software development, pose difficulties in analyzing and testing software security. It is essential to know the variables used in software and the data type information of each variable in order to identify the major weaknesses in the software. However, because the third-party library is generally of the binary code form, the variables, variable data type, program syntax, and semantic information in the source code are removed. Therefore, reconstructing the variables used and the data type information of the variables from binary code is the most important step in weak point analysis. Traditionally, this step of reconstructing information is based on pattern matching;however, the inference of data types is limited. We herein proposed a method of inferring data types using deep learning for variables determined based on pattern matching in binary code, and analyzed its performance. The proposed study has improved the feature generation method to solve the inconsistent problems of the features generated in the previous studies. As a result, the accuracy of prediction of float and double is improved by average 7.2% compared to the previous study, and the result is that the accuracy of 5.1% is increased overall. (C) 2019 Published by Elsevier B.V.
Accurate localization is a critically important issue for autonomous vehicles as it is closely related to the safety and efficiency of autonomous driving. However, current technologies for autonomous vehicle localizat...
详细信息
Accurate localization is a critically important issue for autonomous vehicles as it is closely related to the safety and efficiency of autonomous driving. However, current technologies for autonomous vehicle localization face many challenges. To provide accurate and robust localization services to autonomous vehicles, we propose a novel solution by employing a newly designed pavement marking. This marking operates on color contrast, temperature contrast, and binary code with some special features. We also trained and customized an object detector based on a deep learning model: YOLOv5, and integrated it with the decoding algorithm. The localization system is capable of running at a steady frame rate of more than 50 FPS. Road trials up to 80 km/h were conducted, and satisfactory results confirmed the feasibility and robustness of the localization system. Specifically, with a common onboard camera, more than four continuous frames can be detected and decoded correctly when the speed is slower than 30 km/h. At least one frame can be detected and decoded correctly at a higher speed (i.e., 30 - 50 km/h). With a high-speed camera, more than 18 frames can be detected and decoded even at 80 km/h. The findings suggest that the specially designed road marking and associated algorithms can provide a viable and economical option for accurate localization of autonomous vehicles. The performance of the system has potentials for further improvement by using better hardware such as faster CPUs, GPUs, and thermal imaging techniques.
binary code similarity detection is to detect the similarity of code at binary (assembly) level without source code. Existing work still has their limitation when dealing with mutated binary code with different compil...
详细信息
ISBN:
(纸本)9781665403375
binary code similarity detection is to detect the similarity of code at binary (assembly) level without source code. Existing work still has their limitation when dealing with mutated binary code with different compiling options. We proposed a novel approach to address this problem. By inspecting the binary code, we found that generally, within a function, some instructions aim to calculate (prepare) value for some other instructions. The latter instructions are defined by us the key instructions. Currently, we define four categories of key instructions: calling subfunctions, comparing instruction, returning instruction, and memory address writing instruction. Thus if we symbolically execute similar binary codes, the symbolic value at these key instructions should be similar. We implemented our idea into a tool. This prototype tool can: 1. symbolically execute binary code, 2. extract symbolic values at key instructions into a graph, and 3. compare the symbolic graph similarity. In our implementation, we also address some problems, including path explosion and loop handling.
Isomorphism of kinematic chains (KCs) has always been a critical issue for the researchers dealing with structural synthesis. Consequently, many researchers of repute presented various methods during the last eight de...
详细信息
Isomorphism of kinematic chains (KCs) has always been a critical issue for the researchers dealing with structural synthesis. Consequently, many researchers of repute presented various methods during the last eight decades for the KCs with either simple and/or multiple joints. binary code is one of such various methods, but the major problem lies in the algorithm of links labelling, which becomes cumbersome, in particular, for large KCs. The paper presents a simple algorithm of links labelling used to find out a binary sequence which, in turn, provides a maximum binary code (chain invariant). The algorithm is tested for six, seven, eight, nine, ten, eleven, twelve and fifteen links with simple joints, seven and eight links KCs with multiple joints and finally, the Epicyclic gear trains (EGTs) with four, five and six links for its efficiency and reliability. The results are in full agreement with the references taken for the purpose. The paper discusses, in a unique way, the decoding of the binary codes of different KCs also. (C) 2018 Elsevier Ltd. All rights reserved.
Precise binary code vulnerability detection is an important research topic in software security. Currently, most software is released in binary form, which requires corresponding binary code vulnerability detection me...
详细信息
ISBN:
(纸本)9798350310801
Precise binary code vulnerability detection is an important research topic in software security. Currently, most software is released in binary form, which requires corresponding binary code vulnerability detection methods. Existing deep learning-based detection techniques can only detect binary code vulnerabilities but cannot accurately identify the location of vulnerabilities. Meanwhile, binary vulnerability detection is usually performed at the program or function level, which requires a large amount of markup data and cannot better focus on the vulnerable code. In order to mine the syntactic and semantic information of binary vulnerability code in a more fine-grained way, this paper proposes BVLIFS, a binary code vulnerability location identification system based on program slice. BVLIFS generates binary slices based on control dependencies and data dependencies of library/API function calls, and then uses hierarchical attention neural networks to extract the semantic information at the slice and basic block levels. After that, vulnerability locations are identified by combining the attention mechanism and vulnerability location matrix. We mark different codes with different colors depending on the level of contribution to vulnerability detection, which can help developers to locate and fix vulnerabilities. The experimental results show that our proposed method performs better and can locate vulnerabilities quickly compared to existing methods.
作者:
Sole, PTillich, JPESSI
CNRS I3S Lab Informat 650 F-06903 Sophia Antipolis France Univ Caen
Dept Informat F-14032 Caen France
The coset graph of a nondegenerate cyclic code is orbital regular. This yields a lower bound on its average distance, a parameter which measures the average distortion of a code used in data compression. Using results...
详细信息
The coset graph of a nondegenerate cyclic code is orbital regular. This yields a lower bound on its average distance, a parameter which measures the average distortion of a code used in data compression. Using results of Shahrokhi and Szekely we generalize this bound to binary codes with a transitive automorphism group. (C) 1998 Elsevier Science B.V. All rights reserved.
Program developers spend significant time on optimizing and tuning programs. During this iterative process, they apply optimizations, analyze the resulting code, and modify the compilation until they are satisfied. Un...
详细信息
Program developers spend significant time on optimizing and tuning programs. During this iterative process, they apply optimizations, analyze the resulting code, and modify the compilation until they are satisfied. Understanding what the compiler did with the code is crucial to this process but is very time-consuming and labor-intensive. Users need to navigate through thousands of lines of binary code and correlate it to source code concepts to understand the results of the compilation and to identify optimizations. We present a design study in collaboration with program developers and performance analysts. Our collaborators work with various artifacts related to the program such as binary code, source code, control flow graphs, and call graphs. Through interviews, feedback, and pair-analytics sessions, we analyzed their tasks and workflow. Based on this task analysis and through a human-centric design process, we designed a visual analytics system Compilation Navigator (CcNav) to aid exploration of the effects of compiler optimizations on the program. CcNav provides a streamlined workflow and a unified context that integrates disparate artifacts. CcNav supports consistent interactions across all the artifacts making it easy to correlate binary code with source code concepts. CcNav enables users to navigate and filter large binary code to identify and summarize optimizations such as inlining, vectorization, loop unrolling, and code hoisting. We evaluate CcNav through guided sessions and semi-structured interviews. We reflect on our design process, particularly the immersive elements, and on the transferability of design studies through our experience with a previous design study on program analysis.
作者:
Han, YYSong, YJHanyang Univ
Dept Elect Commun Engn Digital Commun Lab Sungdong Gu Seoul 133791 South Korea
It is important to know phase offsets of a binary code in the field of mobile communications because different phase offsets of the same code are used to distinguish signals received at a mobile station from those of ...
详细信息
It is important to know phase offsets of a binary code in the field of mobile communications because different phase offsets of the same code are used to distinguish signals received at a mobile station from those of different base stations. When the period of the code is not very long, the relative phase offset between the code and its shifted code can be found by counting the number of bits delayed from the code of the same bit streams. But as the period of the code increases, it becomes difficult to find the phase offset. This paper proposes a new method to calculate the phase offset of a binary code. We define an accumulator function, which is used to calculate the phase offsets between the code and its shifted code. Also the properties of the accumulator function are investigated. This number theoretical approach and its results show that this method is very easy for the phase offset calculation. Its application to the code division multiple access (CDMA) system to define a reference code is given. The simple circuit realization of the accumulator function to calculate the phase offset between the received code and receiver stored replica code is described.
We describe a binary (16, 2816,3) code and therefore show A(16, 3) >= 2816. This improves on the previously known bound A(16,3) >= 2720. (C) 2015 Elsevier B.V. All rights reserved.
We describe a binary (16, 2816,3) code and therefore show A(16, 3) >= 2816. This improves on the previously known bound A(16,3) >= 2720. (C) 2015 Elsevier B.V. All rights reserved.
暂无评论