• 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 Society of Industrial and Systems Engineering
• /
• v.31 no.4
• /
• pp.100-105
• /
• 2008

Cost reduction, time to market, and quality improvement of software product are critical issues to the software companies which try to survive in recent competitive market environments. Software Product Line Engineering (SPLE) is one of the approaches to address these issues. The goal of software product line is to maximize the software reuse and achieve the best productivity with the minimum cost. In software product line, software components are classified into the common and variable modules for composition work. In this paper, we proposed a dynamic composition process based on aspect-oriented programming methodology in which software requirements are classified into the core-concerns and cross-cutting concerns, and then assembled into the final software product. It enables developers to concentrate on the core logics of given problem, not the side-issues of software product such as transactions and logging. We also proposed useful composition patterns based on aspect oriented programming paradigm. Finally, we implemented a prototype of the proposed process using Java and Aspect to show the proposed approach's feasibility. The scenario of the prototype is based on the embedded analysis software of telecommunication devices.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4398-4417
• /
• 2017

Multi-user Multiple-Input and Multiple-Output (MU-MIMO) has potential for prominently enhancing the capacity of wireless network by simultaneously transmitting to multiple users. User selection is an unavoidable problem which bottlenecks the gain of MU-MIMO to a great extent. Major state-of-the-art works are focusing on improving network throughput by using Channel State Information (CSI), however, the overhead of CSI feedback becomes unacceptable when the number of users is large. Some work does well in balancing tradeoff between complexity and achievable throughput but is lack of consideration of fairness. Current works universally ignore the rational utilizing of time resources, which may lead the improvements of network throughput to a standstill. In this paper, we propose TOUSE, a scalable and fair user selection scheme for MU-MIMO. The core design is dynamic-time-warping-based user selection mechanism for downlink MU-MIMO, which could make full use of concurrent transmitting time. TOUSE also presents a novel data-rate estimation method without any CSI feedback, providing supports for user selections. Simulation result shows that TOUSE significantly outperforms traditional contention-based user selection schemes in both throughput and fairness in an indoor condition.

• Journal of Information Technology Services
• /
• v.4 no.1
• /
• pp.117-128
• /
• 2005

When we conduct development of a large-size SI project, it is highly necessary to utilize an appropriate application framework which helps to build a qualified software with high productivity in a short period of time. In this paper, we propose the architecture of a dynamically reconfigurable CBD application integration framework that has been used for developing large-scale e-business applications to achieve high development productivity and maintainability. This Integration framework can easily extend its functionalities, and dynamically change its configuration during run time according to the business category, such as applying interaction patterns among main components in software architecture, rules, policies, and environmental parameters. Dynamic reconfiguration has the feature to make applications be easily customized for changeable requirements. Through our application integration framework, huge sizes of contents can be managed according to the business category as well, by keeping configuration informations and huge volumes of source codes. In order to evaluate out application integration framework in terms of performance criteria, we present experimental results of throughputs from the framework by yielding dynamic configuration without any performance degradation.

• Research in Mathematical Education
• /
• v.13 no.3
• /
• pp.217-233
• /
• 2009

The purpose of this study is to describe how dynamic geometry systems can be useful in proof activity; teaching sequences based on the use of dynamic geometry systems and to analyze the possible roles of dynamic geometry systems in both teaching and learning of proof. And also dynamic geometry environments can generate powerful interplay between empirical explorations and formal proofs. The point of this study was to show that how using dynamic geometry software can provide an opportunity to link between empirical and deductive reasoning, and how such software can be utilized to gain insight into a deductive argument.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.2
• /
• pp.57-63
• /
• 2012

Software release planning model of software product lines was formulated as a precedence-constrained multiple 0-1 knapsack problem. The purpose of the model was to maximize the total profit of an entire set of selected features in a software product line over a multi-release planning horizon. The solution approach is a dynamic programming procedure. Feasible solutions at each stage in dynamic programming are determined by using backward dynamic programming approach while dynamic programming for multi-release planning is forward approach. The pre-processing procedure with a heuristic and reduction algorithm was applied to the single-release problems corresponding to each stage in multi-release dynamic programming in order to reduce the problem size. The heuristic algorithm is used to find a lower bound to the problem. The reduction method makes use of the lower bound to fix a number of variables at either 0 or 1. Then the reduced problem can be solved easily by the dynamic programming approaches. These procedures keep on going until release t = T. A numerical example was developed to show how well the solution procedures in this research works on it. Future work in this area could include the development of a heuristic to obtain lower bounds closer to the optimal solution to the model in this article, as well as computational test of the heuristic algorithm and the exact solution approach developed in this paper. Also, more constraints reflecting the characteristics of software product lines may be added to the model. For instance, other resources such as multiple teams, each developing one product or a platform in a software product line could be added to the model.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.6
• /
• pp.305-312
• /
• 2018

Software has been used to develop many functions of the modern weapon systems which has a high mission criticality. Weapon system software must consider multi-threaded processing to satisfy growing performance requirement. However, developing multi-threaded programs are difficult because of concurrency faults, such as unintended data races. Especially, it is important to prepare analysis for debugging the data races, because the weapon system software may cause personal injury. In this paper, we present an efficient framework of analysis, called ConDeWS, which is designed to determine the scope of dynamic analysis through using the result of static analysis and fault analysis. As a result of applying the implemented framework to the target software, we have detected unintended data races that were not detected in the static analysis.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.2
• /
• pp.11-18
• /
• 2012

Smart Dynamic Pricing has been introduced to address the under-utilised network resources problem in mobile telecommunications systems. In this paper, we investigate the applicability of Smart Dynamic Pricing and its signalling models into Cognitive Radio Systems. Cognitive Radio System is defined as one in which cognitive radios are employed to access shared spectrum and/or dynamically allocated spectrum. Network elements, protocols, traffic and control channels, and system architecture are proposed for the implementation of Smart Dynamic Pricing in Cognitive Radio System. It is found that Smart Dynamic Pricing and its signalling models can be applied to Cognitive Radio Systems.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.11
• /
• pp.1-7
• /
• 2017

In this paper, we introduce three monitoring filtering techniques which reduce the overheads of dynamic data race detection. It is well known that detecting data races dynamically in multi-threaded programs is quite hard and troublesome task, because the dynamic detection techniques need to monitor all execution of a multi-threaded program and to analyse every conflicting memory and thread operations in the program. Thus, the main drawback of the dynamic analysis for detecting data races is the heavy additional time and space overheads for running the program. For the practicality, we also empirically compare the efficiency of three monitoring filtering techniques. The results using OpenMP benchmarks show that the filtering techniques are practical for dynamic data race detection, since they reduce the average runtime overhead to under 10% of that of the pure detection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.123-144
• /
• 2014

Wireless sensor networks are generally deployed for specific applications to accomplish certain objectives over a period of time. To fulfill these objectives, it is crucial that the sensor network continues to function for a long time, even if some of its nodes become faulty. Energy efficiency and fault tolerance are undoubtedly the most crucial requirements for the design of an information extraction protocol for any sensor network application. However, most existing software agent based information extraction protocols are incapable of satisfying these requirements because of static agent itineraries and large agent sizes. This paper proposes an Information Extraction protocol based on Multiple software Agents with Dynamic Itineraries (IEMADI), where multiple software agents are dispatched in parallel to perform tasks based on the query assigned to them. IEMADI decides the itinerary for an agent dynamically at each hop using local information. Through mathematical analysis and simulation, we compare the performance of IEMADI with a well known static itinerary based protocol with respect to energy consumption and response time. The results show that IEMADI provides better performance than the static itinerary based protocols.