• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.371-380
• /
• 2009

Recently, lots of research on automated test data generation has been actively done. However, techniques for automated test data generation presented so far have been proved ineffective for programs with flag variables. It can present problems when considering embedded systems such as engine controllers that make extensive use of flag variables to record state information concerning devices. This paper introduces a technique for generating test data effectively for programs with flag variables. The presented technique transforms the test data generation problem into a SAT(SATisfiability) problem and makes advantage of SAT solvers for automated test data generation(ATDG). For the ends, we transform a program under test into Alloy which is the first-order relational logic and then produce test data via Alloy analyzer.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1295-1305
• /
• 1999

In this paper, we present the implementation and performance analysis of H.324M mobile multimedia terminal which s under standardization. The H.324M is the mobile extension of H.324 which is the standard for low bit rate multimedia terminals operating over GSTN. For H.324M, the multiplexing protocol (H.223) of H.324 is enhanced to protect data from the transmission errors over mobile channels. The multiplexing protocol of H.324M is classified into Levels 0, 1, 2, and 3 depending on the level of error protection. Each Level is analyzed according to different types of the data loss elements. Simulation results show that the loss caused by the corrupted flag and header produces the most serious performance degradation. Levels 1 and 2 which protect the header and flag are effective in reducing the total loss. Furthermore, the optimal flag length and threshold value for Levels 1 and 2 are determined.

• Journal of Advanced Navigation Technology
• /
• v.7 no.2
• /
• pp.199-205
• /
• 2003

In this paper, CSMA/CA protocol is modified for aeronautical VHF communication through collision alleviation and the change of retransmission slot selection method in flag used transmission. When collision occurred in the contention period of CSMA/CA process, it is generally waiting for retransmission delay and it has the double size of CW(Contention Window). To solve this problem, this paper modifies the change procedure of original contention window size and reduces the state transition in collision among the whole of it. Also, in this paper we reduces the second collision probability through the station has to enter Backoff mode with increased contention window in the first collision. In the result of simulation, it is verified that it has good property in throughput and delay, So the proposed protocol is suitable for aeronautical VHF communication.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.123-132
• /
• 2012

This paper presents a goal-oriented test data generation technique that specializes concolic testing. The proposed technique, referred to as GCT (Goal-oriented Concolic Testing) produces test inputs which execute a specific target. Concolic testing can be seen as the brute force approach to search the space of all possible paths until a required test input is found. In contrast, GCT restricts the number of program paths that are explored by using data flow information to identify statements that should be executed beforehand in order for the target to be executed. We conducted experiments to evaluate the performance of GCT with programs with flag variables to show its effectiveness.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2017.01a
• /
• pp.129-130
• /
• 2017

DoS 공격은 증가하고 있지만 비용이 많이 들다보니 제대로 된 방어를 하지 못 하고 공격을 당하는 경우도 많다. 저렴한 DoS 방어 시스템의 필요성이 절실하다. 본 논문에서는 저 대역폭 DoS 공격을 방어하는 시스템 개발을 하고자 한다. 방어시스템의 물리적 구조는 듀얼 홈 게이트웨이 구조를 사용하며, DoS 탐지 방법으로는 일반적인 상황에서의 인 바운드되는 프로토콜별 패킷의 값을 세어 그 값을 평균값과 비교하여 탐지하며, 1초 단위로 IP와 SYN, FIN 플래그 값을 세어 그 값을 평균값과 비교하여 탐지하며, 2초 단위로 IP와 SYN, FIN 플래그 값을 세어 임계값을 넘어서면 차단하는 방식을 사용한다.

• Journal of Information Technology and Architecture
• /
• v.11 no.3
• /
• pp.321-332
• /
• 2014

In this paper we propose a new notion of predictable flags type of authorization for controlling access to XML documents. By using predictable flags, we are able to efficiently detect conflicts between existing authorizations and new authorizations to be added. XML documents have an element-composition hierarchical structure in that a higher level element consists of multiple lower level sub-elements. Many XML documents systems have used the notion of implicit authorization that grants authorizations to an element and the all descendants to avoid the overhead caused by explicitly storing all authorization for each element. When we grant an authorization on an element in the XML documents, the implicit authorization method is inefficient in determining the conflicts since it needs to examine all authorizations on the descendants of that element. In contrast, our mechanism using predictable flags has the advantage of detecting the conflicts immediately at the element where an explicit authorization is to be granted.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.296-301
• /
• 2007

본 논문은 낸드 플래쉬 디바이스의 고질적인 문제인 마운트 지연시간을 바이트 접근성을 가지는 비휘발성 저장소자를 이용하여 해결하는 기법을 다룬다. 낸드 플래쉬 디바이스를 사용하기 위해서는, 마운트시에 낸드 플래쉬 디바이스의 전 영역에 걸쳐 분산되어 저장되어 있는 메타 데이터를 스캔하여, 해당 파일 시스템 파티션의 사용-구성정보 자료를 주기억장치에 생성해야 한다. 이러한 과정은 대용량 낸드 플래쉬 디바이스를 사용하는 경우 매우 긴 시간을 필요로 하게 되어 실제 환경에서는 낸드 플래쉬 디바이스를 채용하기가 어렵다. 본 논문에서는 차세대 비휘발성 저장장치의 바이트 단위의 접근 가능성을 활용한다. 낸드 플래쉬 디바이스 마운트시에 생성되는 최종 자료구조를 직접 NVRAM에 저장함으로써 낸드 플래실 디바이스의 메타 데이터를 스캔 하는 절차를 완전히 제거하였다. 즉, 낸드 플래처 디바이스의 마운트에 필요한 메타 데이터의 In-memory Data Structure를 NVRAM상에 저장하여 두면 이 후 NVRAM상에는 그 정보가 계속 유지되어 있기 때문에 낸드 플래쉬 디바이스의 마운트 동작은 단순히 Memory Pointer Mapping 정도의 간단하고 빠른 동작만으로도 충분하다. 본 논문에서는 비휘발성 메모리 소자가 블록 디바이스와 메모리 영역에 동시에 사상되어 있는 융합 파일 시스템을 성공적으로 개발하였다. 마운트 시간의 측정결과 효율적인 기존의 낸드 플래쉬 파일 시스템인 YAFFS에 비해 파티션의 크기나 파티션내 File의 개수에 관계없이 그 값이 매우 작고 고정적인 수치를 갖는다는 것을 확인하였다.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.7
• /
• pp.451-460
• /
• 2013

In order to achieve high test coverage, it is usual to generate test data using various techniques including symbolic execution, data flow analysis or constraints solving. Recently, a technique for automated test data generation that fulfills high coverage effectively without those sophisticated means has been proposed. However, the technique shows its weakness in the generation of test data that leads to high coverage for programs having branch conditions where different memory locations are binded during execution. For certain programs with flag conditions, in particular, high coverage can not be achieved because specific branches are not executed. To address the problem, this paper presents dynamic branch coverage criteria and a test data generation technique based on the notion of dynamic branch. It is shown that the proposed technique compared to the previous approach is more effective by conducting experiments involving programs with flag conditions.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.221-224
• /
• 2009

본 논문에서는 OpenVG Specification에서 제안한 파이프라인을 기능별, 혹은 연산별로 그룹화 하여 하드웨어 구현에 적합한 새로운 파이프라인을 제안하였다. 래스터라이저에서는 스캔라인 알고리즘과 엣지 플래그 알고리즘의 장점들을 포함하는 스캔라인 엣지 플래그 알고리즘을 구현하여 적용하였으며, Non-Zero 룰을 만족하기 위해 엣지의 방향에 따라 Winding 횟수를 기록하기 위한 추가 버퍼를 이용하였다. 또한, 래스터라이저는 안티 앨리어싱을 위해 슈퍼 샘플링 과정을 수행한다. 액티브 엣지 생성 시 클리핑을 동시에 수행하여 이후 과정에서의 불필요한 연산을 줄였고, 액티브 엣지들의 정렬을 수행하지 않는 방법을 사용하여 처리 속도를 향상 시켰다. 본 연구에서 설계된 OpenVG Rasterizer는 크로노스 그룹에서 제공하는 샘플 이미지들을 사용하여 검증하였다.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.253-264
• /
• 2003

This paper presents the analytic model of Distributed Denial-of-Service (DDoS) attacks in two settings: the normal Web server without any attack and the Web server with DDoS attacks. In these settings, we measure TCP flag rate, which is expressed in terms of the ratio of the number of TCP flags, i.e., SYN, ACK, RST, etc., packets over the total number of TCP packets, and Protocol rate, which is defined by the ratio of the number of TCP (UDP or ICMP) packets over the total number of W packets. The experimental results show a distinctive and predictive pattern of DDoS attacks. We wish our approach can be used to detect and prevent DDoS attacks.