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

소프트웨어가 대형화되고 복잡해짐에 따라 발생하는 오류가 증가되고 있다. 안전성이 특히 중요시되는 안전필수(safety-critical) 내장형 시스템에서 오류가 발생하면 인명상의 피해 또는 재산상의 피해를 야기한다. 개발 후, 테스팅을 통해 이런 오류를 찾는 비용은 매우 크고, 모든 오류를 찾는 것은 불가능하다고 인식되고 있다. 따라서 소프트웨어 개발단계에서 이런 오류를 탐지하고 제거하려는 노력이 증대되고 있다. 본 논문에서는 SPARK Ada를 사용하여 안전필수 내장형 시스템을 개발할 때, 오류를 제거할 수 있는 흐름분석(flow analysis) 기법을 사용하여 특정한 타입의 오류를 제거할 수 있음을 보인다. 또한 이를 적용하여 안전필수 시스템을 개발한다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.07a
• /
• pp.493-494
• /
• 2014

본 논문에서는 2014년도 청강문화산업대학교 게임전공에서 진행된 졸업 작품의 QA 절차에 대해 서술 되어 있다. 졸업 작품이 기획될 때부터 기획서나 관련 문서들을 분석하여 QA가 어떻게 진행되었는지에 대한 내용과 QA를 진행한 결과에 대한 분석이 포함되어있다. QA가 진행된 게임은 Unity 3D 엔진으로 개발된 '안드로메다'팀의 1Hour 과 야근컴퍼니'팀의 Epi&Sode, '개미즈'팀의 DeadLine 이며 QA에 사용된 기법은 '체크리스트(check lists)라는 기법을 이용하였다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.07a
• /
• pp.307-310
• /
• 2014

본 논문에서는 여러 가지 소프트웨어 테스트 기법 중 "체크리스트" 기법을 이용하여 2014년 청강문화산업대학 게임전공 졸업작품 게임 13점을 대상으로 테스트를 진행하고 그에 따른 결과에 대해 의견을 제시한다. "체크리스트"란 테스트하거나 평가해야 할 내용과 경험을 나열해 놓은 것을 의미하며, 체계적으로 도출되기 보다는 테스트 경험과 노하우를 정리하고 목록화하여 테스팅에서 해당 내용을 누락 없이 검증하는 것을 목적으로 작성하는 문서다. 테스트의 진행은 개발팀의 기획서 분석에서 시작되며, 기획서에서 기반한 게임의 실제 구현비율과 동작 가능한 비율을 중점으로 평가하였다.

• Journal of KIISE:Software and Applications
• /
• v.29 no.7
• /
• pp.450-464
• /
• 2002

Many modern complex systems, including most object-oriented systems, have dynamic characteristics that their components are dynamical]y configured during run-time. However, few analysis techniques are available that consider the dynamic nature of systems explicitly. We propose a specification and analysis method for these dynamic systems. We design a new temporal logic, called HDTL, to specify the properties of dynamically evolving systems, and tune up the tableau method for this logic. HDTL incorporates variables and quantifiers that enable the automatic analysis. Using HDTL and the analysis method, we can specify the correctness requirements of systems and check whether the system actually agree with the requirements or not. An experiment shows that HDTL is suitable for specifying dynamic properties and the analysis technique works well.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.2
• /
• pp.232-241
• /
• 1999

기존의 연구는 FSM을 기본으로 제어흐름만을 분석하거나 시험목적을 시험열 생성 단계에서 고려하지 않음으로써 시험열의 실제 적용에 있어 많은 문제점을 갖는다. 따라서 이 연구에서는 SDL로 기술된 프로토콜 명세서를 시멘틱 모델인 LTS로 변환 후 LTS로부터 서브투어 단위로 시험열을 생성하였다. 그리고 생성된 시험열을 TTCN으로 변환하고 단위 테스트를 위한 추가 정보로서 프리앰블, 포스트앰블, 리셋 정보등을 LTS로부터 생성하였다. 또한 LTS로부터 한 노드에서 전이 가능한 모든 경로를 트리로 표현함으로서 향상된테스트 커버리지를 갖는 서브투어를 생성하였으며 SDL을 시맨틱 모델인 STS로의변환 EH한 기존의 입력과 출력만을 고려하는 FSM에서 발생하는 비결정성 문제를 해결할 수 있다. 따라서 이 연구에서의 테스트 목적이 고려된 TTCN 표현의 테스트 케이스 생성은 적합성 시험을 위한 테스스 케이스의 실제 적용 및 프로토콜 구현의 생산성을 높일 수 있으며 테스팅 환경의 기반을 제공한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.4
• /
• pp.661-671
• /
• 2022

Due to the COVID-19 pandemic, remote working, e-learning, e-teaching and online collaboration have widely spread and become popular. Accordingly, the usage of IPsec VPN for security reasons has also dramatically increased. With the spread of VPN, VPN vulunerabilities are becoming an important target of attack for attackers, and many studies have been conducted on this. IKE v2 analysis is an essential process not only for developing and building IPsec VPN systems but also for security analysis. Network packet analysis tools such as Wireshark and Tcpdump are used for IKE v2 analysis. Wireshark is one of the most famous and widely-used network protocol analyzers and supports IKE v2 analysis. However Wireshark has many limitations, such as requiring system administrator privileges for IKE v2 analysis. In this paper, we describe Wireshark's limitations in detatil and propose a new analysis method. The proposed analysis method can analyze all encrypted IKE v2 messages in real time from the session key exchange In addition, the proposed analysis method is expected to be used for dynamic testing such as fuzzing as packet manipulation.

• Journal of Korea Water Resources Association
• /
• v.33 no.2
• /
• pp.247-262
• /
• 2000

In this paper, the WSANN(Water Stage Analysis with Neural Network) model was presented so as to predict flood water stage at Jindong which has been the major stream gauging station in Nakdong river basin. The WSANN model used the improved backpropagation training algorithm which was complemented by the momentum method, improvement of initial condition and adaptive-learning rate and the data which were used for this study were classified into training and testing data sets. An empirical equation was derived to determine optimal hidden layer node between the hidden layer node and threshold iteration number. And, the calibration of the WSANN model was performed by the four training data sets. As a result of calibration, the WSANN22 and WSANN32 model were selected for the optimal models which would be used for model verification. The model verification was carried out so as to evaluate model fitness with the two-untrained testing data sets. And, flood water stages were reasonably predicted through the results of statistical analysis. As results of this study, further research activities are needed for the construction of a real-time warning of the impending flood and for the control of flood water stage with neural network method in river basin. basin.

• Journal of Convergence for Information Technology
• /
• v.7 no.6
• /
• pp.187-192
• /
• 2017

The Android operating system currently has a proven method of Unity optimization. However, the Tizen operating system does not know how effective the existing Unity optimization method can be applied to the Tizen operating system and how effective it is. In this paper, we analyze the efficiency of applying Unity optimizing techniques of Android operating system to Tizen operating system. To get this purpose, this study investigates whether the existing Unity optimization method can be applied to Tizen operating system and evaluates the efficiency of the method through Unity Profiler. This research will allow us to further evaluate the Unity optimizations for the existing Android operating system in the future.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.1975-1986
• /
• 1997

Recent evolution of communication networks has led toward increasingly a complex, large-scale protocol. Protocol conformance tests therefore, which consider only control flow, have many problems on testing data flow, transition condition, delay and so on. We propose, design, and implement the tool to solve these problems. The tool, which solves nondeterminism, generates test suites from an integrated flow graph and excludes infeasible path with reachable tree. The presented tool reduces the length of UIO sequence and is efficient partially to test the path that error rate is high. Our automatic test suite generator provides basis of protocol testing environment and high production.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.12
• /
• pp.829-840
• /
• 2013

This paper proposes a modified RRT (Rapidly exploring Random Tree) algorithm utilizing a heuristic input analysis and suggests a test case generation method from Simulink/Stateflow model using the proposed RRT algorithm. Though the typical RRT algorithm is an efficient method to solve the reachability problem to definitely be resolved for generating test cases of model in a black box manner, it has a drawback, an inefficiency of test case generation that comes from generating random inputs without considering the internal states and the test targets of model. The proposed test case generation method increases efficiency of test case generation by analyzing the test targets to be satisfied at the current state and heuristically deciding the inputs of model based on the analysis during expanding an RRT, while maintaining the merit of RRT algorithm. The proposed method is evaluated with the models of ECUs embedded in a commercial passenger's car. The performance is compared with that of the typical RRT algorithm.