• Journal of KIISE:Software and Applications
• /
• v.27 no.6
• /
• pp.607-617
• /
• 2000

Concurrent programs, which are composed of threads that can operate concurrently, are intrinsically nondeterministic. Therefore, we can not directly apply classical testing or debugging techniques developed for sequential programs to concurrent programs because of the nonreproducibility due to nondeterminism. In this paper, we present a source tranformation method to guarantee the reproducibility of multi-threaded programs written in Java programming language. Once a mutli-threaded program has been transformed according to the transformation rules, we can force the program's execution to follow the given sequence of synchronized methods repeatedly and reduce the efforts to find the source of the errors. In addition, we present a method for checking the feasibility of the synchronized method sequence to be replayed.

• The Journal of the Korea Contents Association
• /
• v.12 no.8
• /
• pp.13-19
• /
• 2012

This paper introduces a test-bed toolkit for evaluating and enhancing text analysis engines which extract technological knowledge from articles, patents, reports and so forth. The toolkit consists of two test-beds for technical entity recognition and relation extraction engines, which are capable of identifying technical entities and predicting semantic relation types between the entities. With using the introduced toolkits, users and developers can efficiently perform the execution monitoring and error analysis of the technical text analysis engines.

• Journal of Digital Convergence
• /
• v.10 no.6
• /
• pp.41-47
• /
• 2012

These days, job creation affair is the largest national affair. Although, this government has been persevering in one's efforts, job is not created easily. One of the reasons is the problem of statistics of the job and policy errors by this wrong statistics. This article's purposes are to examine the problems of statistics of the job as base of existing policy, and to analyze the power of job creation of various industries. Especially, this study will light up job creativity of SW industry which is more important than other area in the job creation.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2323-2333
• /
• 1998

Software engineers generally analyze the program behavior under the test case that revealed the error, not under any teneric est case. In this paper we discuss the dynamic slice consisting of all statements that actually affect the value of a variable occurrence for a given program input. We propose an efficient algorithm to make dynamic program slices. The eficiency of this algorithm is evaluated on some developed program. results are shown by a marking table of execution history. Dynamic Dependence Graph, and Reduced Dynamic Dependence Graph, Consequently, the efficiency of the proosed algorithm is also presented by the compariso with algorithm that was announced previously.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.1
• /
• pp.1-8
• /
• 2015

Safety critical systems require exhaustive verification of safety properties, because even a single corner-case fault can cause a critical safety failure. However, existing verification approaches are too costly in terms of time and computational resource required, making it hard to be applied in practice. In this paper, we implemented a tool for minimizing the size of the verification target w.r.t. verification properties to check, based on program slicing technique[1]. The efficacy of program slicing using our tool is demonstrated in a case study with a verification target Trampoline[3], which is an open source automotive operating system compliant with OSEK/VDX[2]. Experiments have shown enhanced performance in verification, with a 71% reduction in the size of the code.

• Journal of Intelligence and Information Systems
• /
• v.15 no.3
• /
• pp.67-80
• /
• 2009

By a number of sensors and sensor networks, we can collect environmental information from a certain sensor space. To discover more useful information and knowledge, we want to employ data mining methodologies to sensor data stream from such sensor spaces. In this paper, we present a novel data preprocessing scheme to improve the performances of the data mining algorithms. Especially, ontologies are applied to represent meanings of the sensor data. For evaluating the proposed method, we have collected sensor streams for about 30 days, and simulated them to compare with other approaches.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1209-1212
• /
• 2003

오늘날 인터넷 환경에서의 망은 유무선의 환경이 통합된 하나의 망으로 달수 있다. 일반적인 TCP에서는 무선망에서의 핸드오프나 비트오류 등으로 인한 패킷 손실이 발생하는 경우에도 흔잡제어 알고리즘으로 손실된 패킷을 복구하게 되며 이러한 복구는 혼잡윈도우를 줄이게 됨으로 인해 현저히 TCP의 처리량을 감소시키게 된다. 본 논문에서는 유무선이 통합된 망에서 데이터 전송 효율을 높일 수 있는 알고리즘을 제시하고자 한다. 이 알고리즘에서는 홈서버를 사용하여 무선망에서 발생한 패킷 손실이 종단간의 재전송이 아닌 홈서버에서 지역 재전송을 함으로써 유무선망의 부하를 줄이고 흔잡제어 알고리즘이 실행되는 것을 방지하여 TCP의 성능향상을 가져올 수 있으며 캐쉬메모리에 재전송 패킷을 보관하여 재전송함으로써 보다 빠른 재전송효과를 얻을 수 있다.

• Journal of Korea Multimedia Society
• /
• v.13 no.3
• /
• pp.359-368
• /
• 2010

Algorithm visualization is useful for program testing, debugging and evaluating, as well as visual aids in education. When teaching algorithms and data structures, showing exact behaviors by graphics or animation is more suitable than just explaining them. Current systems for algorithm animation are limited to a couple of specific applications and need a special environment. In the proposed system, programmer writes source program in C and animator embeds visualization scripts in the appropriate location of the program. Then user can get an animation code in form of SVG and see a graphical representation on the web browser. Generated SVG animation code is platform independent and can also interact with other XML applications or HTML.

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

The Side Channel attack methods proposed by P.Kocher are mainly used for cryptanalysis different cipher algorithms even though they are claimed to be strongly secured. Those kinds of attacks depend on environment implementation especially on the hardware implementation of the algorithm to the crypto module. side-channel attacks are a type of attack introduced by P.Kocher and is applicable according to each environment or method that is designed. This kind of attack can analyze and also extract important information by reading the binary code data via measurement of changes in electricity(voltage) consumption, running time, error output and sounds. Thus, in this paper, we discuss recent SPA and DPA attacks as well as recent countermeasure techniques.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10b
• /
• pp.319-323
• /
• 2006

본 논문에서는 동작 모델과 작업 목표에 따라 지능 로봇 시스템의 작업 순서를 결정하는 작업 계획기의 설계와 데모시스템에 대해 설명한다. 블랙보드 중심의 분산 제어 구조에서 하나의 독립적인 지식원으로 동작하는 작업 계획기는 작업 관리기의 요청이 있을 때마다 지식베이스로부터 동작 모델과 월드 상태 정보를 제공받아 작업 목표 달성을 위한 작업 계획을 생성한다. 그리고 이렇게 생성된 작업 계획은 오류로 인해 재 계획이 필요할 때까지 작업 관리기를 통해 실행된다. 본 연구의 작업 계획기는 효율적인 작업 계획 생성을 위해 지역 상태공간 탐색법의 하나인 EHC+ 탐색법과 계획그래프-기반의 휴우리스틱 계산법을 적용한다. 본 논문에서는 작업 계획기의 효율성과 블랙보드와의 연계성을 시험하기 위한 데모 시스템에 대해 자세히 설명한다. 이를 통해 지식베이스, 작업 관리기, 컴포넌트 서비스기 등 로봇 제어 구조내의 다른 지식원들과의 인터페이스를 위한 메시지 설계도 소개한다.