• Journal of KIISE:Software and Applications
• /
• v.28 no.6
• /
• pp.403-413
• /
• 2001

시스템이 진화와 노화를 거듭하는 경우 프로그램을 이해하는데 있어서 가장 정확한 문서는 기존의 시스템 자체에서 추출되어진 정보이다. 프로그램의 이해를 돕기 위한 분석기법중의 하나인 프로그램 슬라이싱은 1984년 Weiser에 의해서 소개되어진 이후 다양한 방향으로 연구가 진행되어져 왔다. 특히, 생성되어지는 프로그램 슬라이스가 사이즈가 크고 충분히 집약적이지 못하다는 문제점과 슬라이스의 계산방법이 효율적이지 못하다는 문제점을 극복하기 위하여 여러 가지 방법들을 시도되어 왔다. 본 논문은 고전적인 슬라이싱 기준에 새로운 파라미터를 추가함으로써 제외개념을 이용하여 보다 함수적으로 응집력있고, 사이즈가 작은 슬라이스를 생성하는 선택 슬라이스를 제시하며 이 선택슬라이스를 계산하기 위한 효율적인 방법을 기술한다. 데이터와 제어의 흐름을 이용하여 선택 슬라이싱을 정의하고, 선택 슬라이싱을 위한 종속그래프를 정의하고 이를 사용하여 선형적 시간 내에 선택 슬라이스를 생성하는 알고리즘을 기술한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.605-608
• /
• 2010

본 논문에서는 가공되지 않은 축적된 교통 정보를 이용하여 교통 전문가와 교통공학 분야의 학생들이 손쉽게 교통 정보를 분석할 수 있는 통합 교통 정보 분석 시스템을 제안한다. 제안하는 시스템은 도시 고속도로 내의 구간과 시간, 일자를 선택하고, 선택한 영역의 교통 수집 정보를 분석하여, 교통 흐름 제어나 교통 정보 분석에 필요한 다양한 정보와 함께 속도 및 밀도, 통행량을 이용한 등고선 그래프를 제공한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.6
• /
• pp.1235-1242
• /
• 2019

While several machine learning technique has been implemented for Android malware categorization, there is still difficulty in analyzing due to overfitting problem and including of un-executable code, etc. In this paper, we introduce our implemented tool to address these problems. Tool is consists of approximately 1,500 lines of Java code, and perform Flow analysis on set of APIs, or on control flow graph. Our tool groups all the API by its relationship and only perform analysis on actually executing code. Using our tool, we grouped 39032 APIs into 4972 groups, and 12123 groups with result of including class names. We collected 7,000 APKs from 7 families and evaluated our feature reduction technique, and we also reduced features again with selecting APIs that have frequency more than 20%. We finally reduced features to 263-numbers of feature for our collected APKs.

• Journal of KIISE:Databases
• /
• v.29 no.2
• /
• pp.138-147
• /
• 2002

The concept of the critical path in the workflow is important because it can be utilized In many issues in workflow systems, e.g., workflow resource management and workflow time management. However, the critical path in the contest of the workflow has not been much addressed in the past. This is because control flows in the workflow, generally including sequence, parallel, alternative, iteration and so on, are much more complex than those in the ordinary graph or network. In this paper we first describe our workflow model that has considerable work(low control constructs. They would provide the sufficient expressive power for modeling the growing complexities of today's most business processes. Then, we propose a method to systematically determine the critical path in a workflow schema built by the workflow control constructs described in our workflow model.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.27-35
• /
• 2008

The CTOC framework was implemented to efficiently perform analysis and optimization of the Java bytecode that is often being used lately. In order to analyze and optimize the bytecode from the CTOC, the eCFG was first generated. Due to the bytecode characteristics of difficult analysis, the existing bytecode was expanded to be suitable for control flow analysis. and the control flow graph was drawn. We called eCFG(extended Control Flow Graph). Furthermore, the eCFG was converted into the SSA Form for a static analysis. Many loops were found in the conversion program. The previous CTOC performed conversion directly into the SSA Form without processing the loops. However, processing the loops prior to the SSA Form conversion allows more efficient generation of the SSA Form. This paper examines the process of finding the loops prior to converting the eCFG into the SSA Form In order to efficiently process the loops, and exhibits the procedures for generating the loop tree.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.14 no.2
• /
• pp.168-174
• /
• 2021

According to the World Agricultural Productivity Report, the current annual average growth rate of agriculture is 1.63%, which is lower than 1.73% to support the world's 10 billion people, which is growing by 2050. The demand for food, feed, and bioenergy is not growing enough to continue to meet the demand, and it is predicting a future food shortage. The purpose of this study was to create a regional irrigation control model for the purpose of reducing the production cost of crops, increasing production, and improving quality, and presenting a model that can give advice to farmers who start farming in the region. The irrigation control modeling presented in this study means to represent the change of medium weight·supply liquid·drainage amount due to changes in the root zone environment according to the passage of time and climate in a graph model. For water control modeling, we collected data on the change in the amount of the root zone environment and the weight of the badge·supply amount·drainage amount from March to June in Nonsan, Buyeo, and Yesan regions in Chungnam Province through the measuring device of the Ministry of Environment in the root region. We set up the parameters for derivation and derived an irrigation control model that can confirm the change in weight·supply liquid·drainage amount over time through the parameters.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.495-504
• /
• 2008

Aspect Oriented Programming(AOP) is a relatively new programming paradigm and has properties that other programming paradigms don't have. This new programming paradigm provides new modularization of software systems by cross-cutting concerns. In this paper, we propose a regression test method for program evolution by AOP. By using JoinPoint, we can catch a pointcut-name which makes it possible to test the incorrect pointcut strength fault and the incorrect aspect precedence fault. Through extending proof rules to aspect, we can recognize failures to establish expected postconditions faults. We can also trace variables using set() and get() pointcut and test failures to preserve state invariant fault. Using control flow graph, we can test incorrect changes in control dependencies faults. In order to show the correctness of our proposed method, channel management system is implemented and tested by using proposed methods.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.5
• /
• pp.151-154
• /
• 2014

An energy of applications had consumed through the complexed inter-action with operating systems, run-time environments, compiler, and applications on various mobile devices. In these days, challenged researches are studying to reduce of energy consumptions that uses energy-oriented high-level and low-level compiler techniques on mobile devices. In this paper, we intented to reduce an energy consumption of Java mobile applications that applied a list instruction scheduling for energy dissipation from dalvik bytecode which extracted Android dex files. Through this works, we can construct the optimized power and energy environment on mobile devices with the limited power supply.

• The Journal of the Korea Contents Association
• /
• v.10 no.3
• /
• pp.122-131
• /
• 2010

In this paper, we design and implement CTOC, a new bytecode analysis and translation tool. We also propose E-Tree, a new intermediate code, to efficiently deal with intermediate codes translated from bytecodes. E-Tree is expressed in a tree form by combining relevant bytecode instructions in basic blocks of eCFG to overcome the weaknesses of bytecodes such as complexity and analytical difficulty. To demonstrate the usefulness and possible extensibility of CTOC, we show the creation process of eCFG and E-Tree through practical bytecode analysis and translation and shows the optimization process of a bytecode program as an example of possible extensibility.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.3
• /
• pp.145-154
• /
• 2006

This paper improves algorithms of Speculative Partial Redundancy Elimination(SPRE) proposed by Knoop et al. Improving SPRE algorithm performs the execution speed optimization based on the information of the execution frequency from profiling and the memory space optimization. The first purpose of presented algorithm is to reduce in space requirements and the second purpose is to de crease the execution time. Since too much weight on execution speed optimization may cause the explosion of the memory space, it is important to consider the size of memory. This fact can be a big advantage in the embedded system which concerns the required memory size more than the execution speed In this paper we implemented the min-cut algorithm, and this algorithm used the control flow graph is constructed with network and partitioned.