• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.576-580
• /
• 2010

Generally, due to the strong coherence between embedded software and hardware or peripheral software, embedded software is tested by using black-box test based on user scenario for the whole system. This paper suggests the method to coordinate between testing and debugging under consideration for difficulties on solving out the defects detected from black-box test. First of all, from test result analysis, it builds up the debugging strategies enable to trace the locations of the defect's causes. And along with the strategies, it implements the generator of test scripts to be performed on the emulator environment. Through these steps, it can coordinate embedded software testing and debugging activities.

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.251-258
• /
• 2006

Aspect-Oriented Software Development is new software development method. It has many advantages related to software performance, maintenance and repair. Also it offers modularization method to a existing programming language for secondary function such as security and fault tolerance. But the present problem is that we have to use new aspect-oriented programming language. Further more when we apply Aspect to legacy system, we have to recompile the source code in order to build software system based on AOSD. In this paper, we propose and design Connector that can be composed with Aspect in legacy system dynamically. To elaborate this work, we use the information of operations about Core and Aspect, and the information of pointcut described with XML. We validate that the proposed Connector has features such as no need of new compiler, no recompilation and no modification of legacy system through case study.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.591-594
• /
• 2000

객체 지향형 소프트웨어가 개발되고 발전함에 따라 동시성 프로그래밍의 수요가 증가하고 그 기법 역시 다양해지고 있다. 이 결과 소프트웨어의 복잡도가 매우 높아지고, 특히 수행시간 복잡도(run-time complexity)가 매우 높아져서 소프트웨어의 설계와 안정성 검증 분야에 많은 문제가 발생되고 있다. 현재 객체 지향형 소프트웨어의 검증을 위한 연구로 소스 코드를 직접 변환시켜 검증하는 방법과 수행시점에서의 검증을 위해 정형 검증 도구가 직접 객체를 표현할 수 있는 방법을 연구하고 있다. 본 논문에서는 소스코드의 변환을 이용한 검증 도구인 java2spin 과 spin 의 동적인 확장인 dSPIN에 대해 살펴보고 두 도구의 차이점과 장단점을 살펴본다.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.24 no.3 s.202
• /
• pp.35-42
• /
• 2006

본 논문에서는 내장형 소프트웨어 시스템, 특히 로봇 소프트웨어를 위한 self-managed 소프트웨어 개발 프레임워크로서 SHAGE 프레임워크를 제안하였다. SHAGE 프레임워크는 소프트웨어를 실행시간에 동적으로 변경시킬 수 있도록 지원하는 여러 모듈로 구성되어 있다. Observer가 외부 상황을 관찰하고 관찰된 상황이 Architecture Broker로 전달되면 후보 아키텍처 재구성 전략을 검색하고 Component Broker가 구체화 컴포넌트들을 검색한 후 상황에 적절한 아키텍처 재구성 전략과 컴포넌트 구성을 Decision Maker가 선택한다. Reconfigurator가 선택된 전략과 컴포넌트 구성을 기초로 로봇의 아키텍처를 재구성한다. 적응행위를 Evaluator가 평가하고 그 결과를 Learner가 축적하여 나중에 Decision Maker가 사용할 수 있게 한다. 프레임워크의 효용성을 확인하기 위해서 실제 로봇을 이용한 사례연구를 수행하였고, 이 실험을 통해 적응 과정을 확인하였다. 로봇은 상황과 사용자의 피드백에 적응하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.998-1003
• /
• 2013

소프트웨어가 복잡해지고 대형화됨에 따라 다양한 소프트웨어 측정 개발에 필요한 비용이 점차 증가하게 되었지만 지금까지 시도된 측정 기법은 정형화되어 있지 않고 다양한 측정 메트릭을 통해 소프트웨어를 측정한다고 해도 측정 결과의 비교와 분석을 통해 수치적 해석 데이터를 얻기가 어려웠다. 따라서 본 논문에서는 사용자의 사용 사례를 통해 패턴을 추출하고 이를 통해 실험 데이터를 만들어 실제 소프트웨어가 동작하는 도중 내부 모듈간의 동적인 관계를 측정할 수 있는 시스템을 제안하였다.

• 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 KIISE:Software and Applications
• /
• v.28 no.12
• /
• pp.875-884
• /
• 2001

Although the self organizing map (SOM) is widely utilized in such fields of data visualization and topology preserving mapping, since it should have the topology fixed before trained, it has some shortcomings that it is difficult to apply it to practical problems, and classification capability is quite low despite better clustering performance. To overcome these points this paper proposes the dynamic topology preserving self-organizing map(DTSOM) that dynamically splits the output nodes on the map and trains them, and attempts to improve the classification capability by combining multiple DTSOMs K-Winner method has been applied to combine DTSOMs which produces K outputs with winner node selection method. This produces even better performance than the conventional combining methods such as majority voting weighting, BKS Bayesian, Borda, Condorect and reliability sum. DTSOM remedies the shortcoming of determining the topology in advance, and the classification rate increases significantly by combing multiple maps trained with different features. Experimental results with handwritten digit recognition indicate that the proposed method works out to problems of conventional SOM effectively so to improve the classification rate to 98.1%.

• 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.

• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1084-1098
• /
• 2005

In this paper, we propose a migration technique for autonomous mobile agents suitable to dynamic environments. The proposed migration technique dynamically creates the itinerary of agents that considers states of networks and systems. In the migration of the agent, it first sends prefetching message to the next system. The system receives necessary data for migration in advance. Through this, we reduce the amount of the sending data and save the time for creating the instance of the agent. And it improves the execution efficiency by using the checkpoint-based recovery method that does not execute the agent again and recovers the process states even though the errors take place. To show superiority of the proposed technique, we compare the proposed method with the existing methods through various simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.172-180
• /
• 2005

Dynamic slicing method decomposes a program into slices and supports to be understood programs easily by software developer or maintainer. In this paper, we propose dynamic slicing algorithm to reduce time to decompose a program. We produce reference-variable set used in right and modify-variable set used in left on the basis of the assignment operator of all sentences and extract Inter-Variable Relationship(VV) for all variables of variable declaration. Proposed algorithm extracts dynamic slices by using them and execution trace of program. In conclusion, proposed algorithm improved the performance by reducing the time to extract dynamic slices by decreasing average comparison count of sentence when the number of criterion variables is three or more.