• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.324-327
• /
• 2019

소프트웨어의 비정상적인 작동인 크래시는 보안 취약점의 원인이 된다. 이러한 크래시로부터 야기되는 취약점을 예방하기 위해 다양한 테스트케이스를 생성하고 크래시를 발견 및 분석하는 연구가 지속되고 있다. 본 논문에서는 북한 소프트웨어 서광사무처리체계에서 사용하는 국제 사무용 전자문서 형식인 Open Document Format for Office Application (ODF)의 워드프로세스 문서 형태인 ODT파일의 효과적인 보안 테스트케이스를 찾기 위해 먼저 테스트케이스를 도출한다. 도출된 테스트케이스를 데이터 전처리한 후 Feature Selection 기법을 적용하여 의미 있는 속성들을 분류한다. 마지막으로 ODT 파일 내에 크래시를 유발하는 유의미한 속성들을 확인하고 퍼징 테스트케이스 작성 시 메트릭으로 활용할 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.1023-1026
• /
• 2015

비용 효율적인 소프트웨어 유지보수 방안에 대한 기대가 높다. 본 논문에서는 유지보수 비용을 감소시키기 위해 회귀 테스트에 사용되는 테스트케이스를 효과적으로 우선순위화하는 방안을 제안한다. 테스트케이스를 우선순위화하는 방법으로는 코드의 커버리지를 이용해 테스트케이스의 우선순위를 높이는 방법과 모델 기반 테스트케이스 우선순위화 방법 등 여러 가지 방법이 제안되어 왔다. 본 논문에서는 소스코드, 커밋 로그와 버그리포트의 정보를 이용해 정보검색 기반의 테스트케이스 우선순위화 기법을 제안한다. 변경된 소스코드 이력은 새로운 기능의 업데이트 유무를 확인 할 수 있으며, 결함으로 수정된 파일을 추측할 수 있다. 버그 리포트는 소스코드의 결함에 대한 정보를 담고 있다. 제안한 방법의 유효성을 확인하기 위해 오픈소스 프로젝트(Joda-Time, Commons-Lang)를 이용해 실험을 진행하였다. 실험을 통해 소스코드, 커밋 로그와 버그리포트로 테스트케이스 우선순위화 방법의 유효성을 확인했으며, 버그리포트를 적용해 테스트케이스 우선순위화 기법을 이전 연구에 비해 최대 8% 향상된 결과를 확인 할 수 있었다.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.153-163
• /
• 2009

It is necessary to identify the use cases of the supplier systems in order to define new service using their functions. Current use case modeling techniques, however, do not represent the external use cases clearly, because the external system is represented only by an actor. This ambiguity of the modeling technique declines the comprehensiveness of the model, and does not limit the scope of the target system explicitly. In this paper, we propose the extended use case modeling technique for service-oriented computing. This modeling technique enables the definition of external use cases and components. They are used to limit the boundary of the target system, and the relationship between them are modeled by the realization of external use cases. The proposed technique uses UML stereotype extension mechanism. so the compatibility with current use case modeling technique is preserved.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.539-542
• /
• 2008

본 연구에서는 Simulink 에서 테스트케이스를 적용하는 과정을 자동화시켜 주었다. Simulink 는 자동 생성된 많은 수의 테스트케이스를 dynamic 하게 적용하는 작업에서 반복적이고 수동적인 다수의 작업이 필요하다. 그래서 Simulink 를 이용한 테스트에 많은 인력과 시간이 필요한 문제점이 있다. 본 연구의 Framework 에서는 파일에 저장된 테스트케이스를 Simulink 에 바로 적용할 수 있게 해주었다. 먼저 Framework 에서 사용된 테스트케이스의 입력방법을 알아보고, Framework 에서의 테스트 수행과정을 나타내고 결과를 분석하였다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.4
• /
• pp.811-820
• /
• 2017

Software automatic technology research recently focuses not only on generating a single path test-case, but also on finding an optimized path to reach the vulnerability through various test-cases. Although Dynamic Symbolic Execution (DSE) technology is popular among these automatic technologies, most DSE technology researches apply only to Linux binaries or specific modules themselves. However, most software are vulnerable based on input files. Therefore, this paper proposes an input file based dynamic symbolic execution method for software vulnerability verification. As a result of applying it to three kinds of actual binary software, it was possible to create a test-case effectively reaching the corresponding point through the proposed method. This demonstrates that DSE technology can be used to automate the analysis of actual software.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.2
• /
• pp.231-242
• /
• 2013

Recently, automated software testing methods such as fuzzing have been researched to find software vulnerabilities. The purpose of fuzzing is to disclose software vulnerabilities by providing a software with malformed data. In order to increase the probability of vulnerability discovery by fuzzing, we must solve the test suite reduction problem because the probability depends on the test case quality. In this paper, we propose a new method to solve the test suite reduction problem which is suitable for the long test case such as file. First, we suggested the length of test case as a measure in addition to old measures such as coverage and redundancy. Next we designed a test suite reduction algorithm using the new measure. In the experimental results, the proposed algorithm showed better performance in the size and length reduction ratio of the test suite than previous studies. Finally, results from an empirical study suggested the viability of our proposed measure and algorithm for file fuzzing.

• KIISE Transactions on Computing Practices
• /
• v.22 no.1
• /
• pp.32-37
• /
• 2016

In model-based testing using sequence diagrams, test cases are automatically derived from the sequence diagrams. For the generation of test cases, scenarios need to be found for representing as a sequence diagram, and to extract test paths satisfying the test coverage. However, it is hard to automatically extract test paths from the sequence diagram because a sequence diagram represents loop, opt, and alt information using CombinedFragments. To resolve this problem, we propose a transformation process that transforms a sequence diagram into an activity diagram which represents scenarios as a type of control flows. In addition, we generate test cases from the activity diagram by applying a test coverage concept. Finally, we present a case study for test cases generation from a sequence diagram.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.9
• /
• pp.21-31
• /
• 2013

ECU(Electric Control Unit) on the important features of the vehicle is equipped, ECU between sending and receiving messages is connected to one of the internal network(CAN BUS), but this network easily accessible from the outside and not intended to be able to receive attacks from an attacker, In this regard, the development of tools that can be used in order to verify the possibility of attacks on attacks from outside, However, the time costs incurred for developing tools and time to analyze from actual car for CAN messages to be used in the attack to find. In this paper, we want to solve it, propose a method to generate test cases required for the attack is publicly available tool called Sulley and it explains how to find the CAN messages to be used in the attack. Sulley add the CAN messages data generated library files in provided library file and than Sulley execute that make define and execute file conform to the CAN communication preferences and create message rules. Experiments performed by the proposed methodology is applied to the actual car and result, test cases generated by the CAN messages fuzzing through Sulley send in the car and as a result without a separate tool developed was operating the car.

• Proceedings of the Korean Institute of Industrial Safety Conference
• /
• 2003.10a
• /
• pp.101-106
• /
• 2003

항공기 외부 장착물인 POD는 전자전 방해장치(ECM, electronic counter measures)로서 전자방해 장비 및 부분 부품인 전ㆍ후방 러그(lug)와 외부 케이스로 이루어져 있다. POD는 항공기 외부 동체 하단부 및 파일런(pylon)에 장착되어 작동하므로 항공기의 운용중 이륙부터 착륙간의 기동에 의한 피로하중을 주로 받게 되므로 POD 부품들에 대한 구조 건전성 확보하기 위해서는 MIL-STD-1530의 요구에 따라 내구성(durability) 및 손상허용설계(damage tolerance design) 의 평가가 요구되고 있다.(중략)

• Journal of the Korea Computer Industry Society
• /
• v.6 no.3
• /
• pp.437-446
• /
• 2005

Workflow mining is a newly emerging research issue for rediscovering and reengineering workflow models from workflow logs containing information about workflow being executed on the workflow engine. This paper newly defines a workflow process reduction mechanism that formally and automatically reduces an original workflow process to a minimal set of activities, which was used proposed 'E-walk series analysis algorithm'. Main purpose of this paper is to minimize discrepancies between the workflow process modeled and the enacted workflow process as it is actually being executed. That means, we compare a complete set of activity firing sequences on buildtime with workflow execution logs which was generate on runtime. For this purpose we proposed two algorithm, the one is 'Activity-Dependent Net Algorithm' and the other is 'E-Walk Series Analysis Algorithm'.