• 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 Korean Institute of Industrial Engineers
• /
• v.26 no.3
• /
• pp.227-237
• /
• 2000

A workflow management system is a software system to assist designing processes, controlling and managing the execution of the designed processes. One emerging trend in many recent information systems is the provision of process management functions. In this paper, we propose a method of designing processes for automatic process execution directly from process modeling. First of all, the concept of block is presented which is to define a nested process model. A block is the minimum unit that can specify the relationships of process components, i.e., tasks. A general process can be defined by a combination of the blocks defined in this paper. An algorithm is developed to transform a general flat process model into a nested model. We identify basic types of blocks and build ECA (Event-Condition-Action) rules for each of the basic types. This allows us to automate the execution of the process model by using the active features of active databases.

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.985-997
• /
• 2004

In this paper, an automatic programming error-diagnosing system is provided for novice C programmers by plan matching and program execution. Program execution results are used to provide flexibility in describing the relationship between programming plans, to verify the correctness of the plan matching differences, and to detect the influence of a plan's error to the related plan. We can give easy and informative explanations to the students according to a plan's error and the resulting effects to related plans. The students are consulted to check their program's correctness with the given test data. Our error-diagnosing system is tested with student's programs for the 14 various and difficult problems and gives acceptable recognition results.

• The KIPS Transactions:PartD
• /
• v.12D no.6 s.102
• /
• pp.889-898
• /
• 2005

Recently, one of the most challenging problems is to compose web services dynamically, that is, on demand. A number of researchers have been considerably interested in the dynamic web services composition. However, while most of them focused on the semi-automatic web services composition with a human controller, very little attention was devoted to the full automation of this process. This paper primarily focuses on the automatic web services composition techniques. The main idea is to implement an automatic web services composition system using web ontologies to realize the semantic web and workflow technologies to play a major role in E-businesses. In this paper, we propose a matching algorithm for web service discovery and present an approach based on the use of ontologies to facilitate the interoperability of web services. Finally, we describe a workflow execution plan to support the automatic web services composition, and an experimental study that shows the high performance of our system.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.6
• /
• pp.1034-1039
• /
• 1987

In this paper, an automatic routing algorithm using Fringe is described. The concept of the Fringe is very simple, but it provides a powerful and flexible tool for doing single layer routing. The automatic routing program is coded using C language, and implemented on a VAX11/750 and IBM -PC AT computer. The usefulness of the routing algorithms is shown by the execution of the program on some examples.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.36 no.5
• /
• pp.309-318
• /
• 1987

In the on-line security analysis of power system, Automatic Contingency Selection (ACS) is commonly used to reduce the number of contingency cases which will be evaluated in detail. This paper describes a fast and reliable ACS method which adopts DC load flow in conjunction with compensation theorem to improve execution time, and applies severity performance index, divided on each limit level for considering overload rate, to make reliable contingency ranking. The method has been tested in IEEE 25 bus system and KEPCO 130 bus actual power system. The results of these tests verify its superiority to both the execution time and reliability, and illustrate its effectiveness for the practical use.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.5
• /
• pp.1036-1042
• /
• 2011

This paper presents an algorithm that conducts automatic memory scrubbing operated by dedicated hardwares. The proposed algorithm is designed so that it can scrub entire memory in a given scrub period, while minimally affecting the execution of flight softwares. The scrub controller is constructed in a form of state machines, which have two execution modes - normal mode and burst mode. The deadline event generator and period tick generator are designed in a separate way to support the behavior of the scrub controller. The proposed controller is implemented in VHDL code to validate its applicability. A simple version of the controller is also applied to mass memory modules used in STSAT-3.

• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.107-113
• /
• 2002

In this paper, we propose a method and a software system for automatic summarization of baseball game videos. The proposed system pursues fast execution and high accuracy of summarization. To satisfy the requirement, the detection of important events in baseball video is performed through DC-based shot boundary detection algorithm and simple caption recognition method. Furthermore, the proposed system supports a hierarchical description so that users can browse and navigate videos in several levels of summarization. In this paper, we propose a method and a software system for automatic summarization of baseball game videos. The proposed system pursues fast execution and high accuracy of summarization. To satisfy the requirement, the detection of important events in baseball video is performed through DC-based shot boundary detection algorithm and simple caption recognition method. Furthermore, the proposed system supports a hierarchical description so that users can browse and navigate videos in several levels of summarization.

• KIISE Transactions on Computing Practices
• /
• v.22 no.3
• /
• pp.139-144
• /
• 2016

There exist many threats in cyber space, however current anti-virus software and other existing solutions do not effectively respond to malware that has become more complex and sophisticated. It was shown experimentally that it is possible for the proposed approach to provide an automatic execution environment for the detection of malicious behavior of active malware, comparing the virtual-machine environment with the real-machine environment based on user interaction. Moreover, the results show that it is possible to provide a dynamic analysis environment in order to analyze the intelligent malware effectively, through the comparison of malicious behavior activity in an automatic binary execution environment based on real-machines and the malicious behavior activity in a virtual-machine environment.

• Korean Management Science Review
• /
• v.20 no.2
• /
• pp.17-31
• /
• 2003

A workflow management system is a software system to support accurate execution, control and management of business processes. It has been known that the system automatically executes complex processes and effectively manages them to improve the productivities. However though existing systems assure the automatic execution of an individual process, there is a room for enhancement from the view of efficient execution of all the processes. In this paper, we propose a method of executing business processes efficiently by introducing the PERT/CPM techniques in the workflow management systems. We first consider the differences between workflow process models and PERT/CPM models, and then develop a method of calculating the critical path and slack time in workflow processes. This leads us to develop a dispatching rule that can guide task performers to prioritize their tasks to increase the efficiency of ail the processes. We have carried out a set of simulation experiments and analyzed the results to demonstrate the effectiveness of the proposed method.