• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.63-72
• /
• 2011

Binary translation is a kind of the emulation method which converts a binary code compiled on the particular instruction set architecture to the new binary code that can be run on another one. It has been mostly used for migrating legacy systems to new architecture. In recent, binary translation is used for instrumenting programs without modifying source code, because it enables inserting additional codes dynamically, For general application, there already exists some instrumentation software using binary translation, such as dynamic binary analyzers and virtual machine monitors. On the other hand, in order to be benefited from binary translation in kernel-level, a few issues, which include system performance, memory management, privileged instructions, and synchronization, should be treated. These matters are derived from the structure of the kernel, and the difference between the kernel and user-level application. In this paper, we present a scheme to apply binary translation and dynamic instrumentation on kernel. We implement it on Linux kernel and demonstrate that kernel-level binary translation adds an insignificant overhead to performance of the system.

• Journal of KIISE:Software and Applications
• /
• v.41 no.7
• /
• pp.501-517
• /
• 2014

Binary translation is a restructuring process in order to execute a program targeting a specific device on the other devices. In binary translation, it is very important to generate the translation rules between two devices. There are two methods for generating the translation rules, direct and indirect mapping. The direct mapping is the method for performance, while the indirect mapping is the method for retargetability. This paper suggests a binary translation method based on the direct mapping for the embedded systems. Because, however, the retargetability is also important requirement, we suggest the direct mapping based binary translation with considering the retargetability. In addition, we implement an automatic generation tool for translation rules to prove our concept. Through this method, we can generate the translation rules with considering the performance as well as the retargetability. Furthermore, we can reduce costs for the binary translation.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.892-899
• /
• 2014

Dynamic binary instrumentation is a code insertion technique for debugging a program without scattering its execution flow, while the program is running. Most dynamic instrumentations are implemented using dynamic binary translation techniques. Existing studies translated program codes dynamically by parsing the machine code stream to intermediate representation (IR) and then applying compilation techniques for IRs. However, they have high overhead during translation, which is a major cause of difficulty in applying the dynamic binary translation technique to the program which requires high responsiveness. In this paper, we introduce a light-weight dynamic binary instrumentation framework based on a novel dynamic binary translation technique which has low overhead while translating the program code. In order to reduce the translation overhead, our approach adopts a tabular-based address translation and exploits a translation bypassing scheme, which stores the translated address of a frequently called library function in advance. It then accesses the translated address and executes function codes without code translation when calling the function. Our experiment results demonstrated that the proposed approach outperforms the prior dynamic binary translation techniques from 2% up to 65%.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.494-496
• /
• 2013

In this paper, we introduce a technique for delayed deallocation of temporary register allocation. We achieve faster binary translation that is used in the context of register allocation. By delaying deallocation of the temporary register containing the value, it is preserved until the next instruction fetched. If subsequent instruction does not require the value again, binary translator deallocate and release the temporary register at the first stage of the next instruction.

• Journal of Information Processing Systems
• /
• v.15 no.6
• /
• pp.1462-1471
• /
• 2019

Real-time embedded systems have become pervasive in general industry. They also began to be applied in such domains as avionics, automotive, aerospace, healthcare, and industrial Internet. However, the system failure of such domains could result in catastrophic consequences. Runtime software testing is required in such domains that demands very high accuracy. Traditional runtime software testing based on handwork is very inefficient and time consuming. Hence, test automation methodologies in runtime is demanding. In this paper, we introduce a software testing system that translates a real-time software into a monitorable real-time software. The monitorable real-time software means the software provides the monitoring information in runtime. The monitoring target are time constraints of the input real-time software. We anticipate that our system lessens the burden of runtime software testing.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.455-458
• /
• 2012

최근 각종 스마트 디바이스의 활용이 급속히 활용이 늘어나고 있다. 본 연구는 ARM to x86 바이너리 변환(Binary Translation) 기술을 통해 인텔의 x86 기반 ATOM 모바일 프로세서에서 ARM target 으로 컴파일된 NDK 활용 안드로이드 애플리케이션을 실행하는 것을 목표로 한다. 본 논문에서는 ARM to x86 관련 바이너리 변환 기존 연구를 분석한 후, 실제적인 ARM to x86 바이너리 변환 플랫폼을 통해 바이너리 변환 사례를 소개한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1714-1717
• /
• 2010

디바이스 드라이버는 커널의 대부분을 차지하기 때문에 디바이스 드라이버에 문제가 발생하면 시스템에 심각한 영향을 미치게 된다. 따라서 디바이스 드라이버의 고장 분리 기술은 운영체제의 신뢰도 향상을 위해서 매우 중요하다. 동적 코드 변환 기법(Binary Translation)은 기계어 코드의 수준에서 기존의 디바이스 드라이버의 명령어 집합을 다른 명령어 집합으로 변환하여 실행하도록 하는 기법이다. 이 기법을 통해 우리는 각 명령어의 변환 과정에서 디바이스 드라이버의 모든 행위를 감시할 수 있다. 따라서 동적 코드 변환기법은 디바이스 드라이버의 고장을 분리하며 악의적인 메모리 접근을 제한하는 장점을 가지고 있다. 또한 커널 코드의 수정과 디바이스 드라이버의 수정이 요구되지 않는다. 이 논문에서 우리는 동적 코드 변환 기법을 설계하고 구현하였다. 그리고 동적 코드변환 기법을 이용한 몇 가지 실험을 통해, 디바이스 드라이버를 수행 시 발생하는 오버헤드와 고장 분리 가능 여부를 평가해 보았다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.149-156
• /
• 2003

This paper proposes a face recognition method based on modified Otsu binarization, Hu moment and linear discriminant analysis (LDA). Proposed method is robust to brightness, contrast, scale, rotation, and translation changes. Modified Otsu binarization can make binary images that have the invariant characteristic in brightness and contrast changes. From edge and multi-level binary images obtained by the threshold method, we compute the 17 dimensional Hu moment and then extract feature vector using LDA algorithm. Especially, our face recognition system is robust to scale, rotation, and translation changes because of using Hu moment. Experimental results showed that our method had almost a superior performance compared with the conventional well-known principal component analysis (PCA) and the method combined PCA and LDA in the perspective of brightness, contrast, scale, rotation, and translation changes with Olivetti Research Laboratory (ORL) database and the AR database.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.207-214
• /
• 2003

Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The linear translation is one of important operations in image processing, which moves the image by a given distance. In this paper, we present an algorithm to perform the linear translation of binary images represented by quadtrees, using three-dimensional $n{\times}n{\times}n$ processors on RMESH (Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of n${\times}$n${\times}$n RMESH.

• Annual Conference on Human and Language Technology
• /
• 1993.10a
• /
• pp.15-24
• /
• 1993

한국어는 구문요소의 문법기능이 표면구조상에 명시되는 구문특성을 갖고 있다. 이러한 특성은 한국어의 문법체계가 feature중심으로 전개되고 있음을 의미한다. 한국어에서의 feature 특성과 이진 결합 관계를 중심으로 하는 chart parsing 알고리즘을 제시하고 한국어 chart parser을 구현하였다.