• Journal of Korea Multimedia Society
• /
• v.3 no.1
• /
• pp.92-100
• /
• 2000

For the operation of the practical software systems, the development of new software, extension and modification phases of current software are successively needed through the new requirements added and their errors debugging detected. We need to understand current program exactly during a working serial jobs. When we'd like to extract the statements which influence the variable of specific statement of program, we generally analyze the program behavior through execution trace of program for the input values. It is important to compute dynamic program slice related to all statements that actually affect the value of a variable occurrence for a given program input and to develop techniques of its implementation. But traditional dynamic slicing techniques are inconvenient to make program execution history at the beginning implementation. In this paper, we propose a new improved algorithm which can produce program slice by use of dynamic control information and program slicing techniques except execution history file. Also we can find that the proposed program slicing approach is more efficient than the traditional program slicing algorithm on the practical testing environment.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.1
• /
• pp.73-81
• /
• 2021

When downloading files using an app or web-based application on the user's mobile phone, the path is set to be saved in the pre-defined default directory. Many applications requiring access to storage, including file managers, require a write or read permission of storage to provide numerous functions and services. This means that the application will have direct access to the download folder where the numerous files downloaded. In this paper, to prove our feasibility of attack using the security vulnerabilities mentioned above, we developed a file hacking function disguised as an encryption function in the file management application. The file that encrypted will be sent to hackers via E-mail simultaneously on the background. The developed application was evaluated from VirusTotal, a malicious analysis engine, was not detected as a malicious application in all 74 engines. Finally, in this paper, we propose a defense technique and an algorithm based on the Trusted Execution Environment (TEE) to supplement these storage vulnerabilities.

• Smart Media Journal
• /
• v.12 no.5
• /
• pp.58-64
• /
• 2023

In Logic Bomb, the conditions of branch statements that trigger malicious behavior cannot be detected in advance, making Android malicious app analysis difficult. Various studies have been conducted to detect potentially suspicious branch statements that can be logic bombs and triggers, but suspicious branch statements cannot be properly detected in apps that contain information determined at runtime, such as reflection. In this paper, we propose a tool that can detect suspicious branch statements even when reflection is used in Android apps. It works through recording app execution logs and analyzing the recorded log). The proposed tool can check the relationship between the called method and the branch statement by recording and analyzing the user-defined methods, Java APIs called and method information called through reflection, and branch information in the log while the Android app is running. Experimental results show that suspicious branch statements can be detected even in apps where reflection is used.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.1
• /
• pp.215-219
• /
• 2014

C programming language has undefined behaviors, which cause unintended execution of a program. When a programmer adds sanity checks without caring about undefined behaviors, compilers may misunderstand and invalidate the sanity checks. Thus, we propose an automated system to detect invalidated sanity checks by marking sanity checks in source code and checking the marks in binary code.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.2
• /
• pp.197-206
• /
• 2000

A hybrid control structure for vision-based soccer robot system is considered. The structure is om-posed of four levels such as the role action behavior and execution levels. The control structure which is a combination of hierarchical and behavioral structures can efficiently meet the behavior and design specifications of a soccer robot system Among the four levels only the design of the action level is proposed in the paper and is experimentally evaluated. Design hypothesis and evaluation method are presented to improve the reliability and accomplishment of the robot system. Due to the essential element of soccer robot system design a systematic design procedure of the action level is proposed With the proposed structure and algorithm of the action level the excellent result was shown at the MiroSot'98 held in France.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.421-425
• /
• 1999

As the market size of multiprocessor systems for commercial applications, parallel systems, especially cache-coherent shared-memory multiprocessors that are conventionally designed for scientific applications need to be tuned in different fashion to achieve the best performance for new application area. In this paper, indepth investigation on the memory behavior which is the primary cause for performance changes were made. We chose representative benchmarks in scientific and commercial application areas. After running execution-driven simulation for bus-based cache-coherent shared-memory multiprocessors, we experienced significant differences and conclude that the systems must be carefully and differently designed to achieve the best performance when they are built for distinct applications.

• Journal of Internet Computing and Services
• /
• v.13 no.1
• /
• pp.83-98
• /
• 2012

Recently Web services and SOA(Service Oriented Architecture) is widely used for an effective integration way of distributed applications. The service choreography is a way of service compositions to define workflows and the message exchange protocols among several partner ser-vices in the B2B business process environment. It defines the overall business process from a global perspective. However, it must be transformed into some kind of the executable form to implement service compositions, because it does not support an execution mechanism but is a de-clarative form. Therefore, the transformed executable model must be validated with the original choreography model to guarantee behavior equivalence. In this paper, we propose the conformity assessment with respect to service compositions method between the choreography model and the transformed executable model. And we suggest the test method to show behavior equivalence between them from a viewpoint of the dynamic execution.

• Journal of the Korea Convergence Society
• /
• v.8 no.5
• /
• pp.37-43
• /
• 2017

A registry is a hierarchy database which is designed to store information necessary for operating system and application programs in Windows operating system, and it is involved in all activities such as booting, logging, service execution, application execution, and user behavior. Digital forensic is widely used. In recent years, malicious codes have penetrated into systems in a way that is not recognized by the user, and valuable information is leaked or stolen, causing financial damages. Therefore, this study proposes a method to detect malicious code by using a shareware application without using expensive digital forensic program, so as to analysis hacking methods and prevent hacking damage in advance.

• Journal of KIISE:Software and Applications
• /
• v.28 no.10
• /
• pp.706-719
• /
• 2001

In this paper, we present a new approach to deterministic execution for testing concurrent programs. The proposed approach makes use of the notion of event independence which has been used in the partial-order method in order to resolve the state-explosion problem and constructs and automation which accepts all the sequences semantically equivalent to a given sequence. Consequently, we can allow a program to be executed according to event sequences other then the (possibly infeasible) given sequence if they have the same effects on the program's behavior. One advantage of this method is that it can be applied to situations where a program is not exactly implemented as described in the specification.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.14 no.4
• /
• pp.391-406
• /
• 2014

The performance of General-Purpose computation on Graphics Processing Units (GPGPU) is heavily dependent on the memory access behavior. This sensitivity is due to a combination of the underlying Massively Parallel Processing (MPP) execution model present on GPUs and the lack of architectural support to handle irregular memory access patterns. Application performance can be significantly improved by applying memory-access-pattern-aware optimizations that can exploit knowledge of the characteristics of each access pattern. In this paper, we present an algorithmic methodology to semi-automatically find the best mapping of memory accesses present in serial loop nest to underlying data-parallel architectures based on a comprehensive static memory access pattern analysis. To that end we present a simple, yet powerful, mathematical model that captures all memory access pattern information present in serial data-parallel loop nests. We then show how this model is used in practice to select the most appropriate memory space for data and to search for an appropriate thread mapping and work group size from a large design space. To evaluate the effectiveness of our methodology, we report on execution speedup using selected benchmark kernels that cover a wide range of memory access patterns commonly found in GPGPU workloads. Our experimental results are reported using the industry standard heterogeneous programming language, OpenCL, targeting the NVIDIA GT200 architecture.