• Journal of the Korea Computer Industry Society
• /
• v.2 no.9
• /
• pp.1199-1208
• /
• 2001

Program slicing is a program decomposition technique to improve the effectiveness of program testing and maintenance. In this paper I propose a method for slicing object-oriented programs and show its correctness. Also, I propose the class interface slicing technique which can eliminate irrelevant data members, subobjects, and methods from the class declaration parts of the given program. And I show its correctness. Finally, I propose the class hierarchy slicing technique which can compute the declarative parts affecting or affected by the given data member. These techniques may be used for information analysis in some area such as class testing.

• Journal of KIISE:Software and Applications
• /
• v.35 no.12
• /
• pp.741-752
• /
• 2008

Aspect-Oriented Software Development(AOSD) is the software development methodology that classifies concerns of the system and identifies crosscutting concerns and organizes aspect class, and AOSD has emerged as an important user-oriented software development methodology with high maintainability. However, most of related studies worked on identification and specification and coding of crosscutting concerns. And there have been few studies on slicing technique for tracing method of specified crosscutting concerns. Therefore, this paper proposes slicing technique based on AOSD that identifies and specifies crosscutting concerns through interactive analysis between use cases; also, suggests slicing technique which improves traceability centering on identified crosscutting concerns; applies the aspect-oriented slicing technique to Learning Management System(LMS) for case-study. LMS is a cyber educational system that demands a lot of functional changes and expansion, so it is effective to apply AOSD with high maintainability in developing LMS; and shows the results that compared with related studies by comparing six elements.

• Journal of Korea Multimedia Society
• /
• v.6 no.4
• /
• pp.736-745
• /
• 2003

Traditional slicing techniques make slices through dependence graphs. They also improve the accuracy of slices. However, traditional slicing techniques require many vertices and edges in order to express a data communication link because they are based on static slicing techniques. Therefore the graph becomes very complicated, and size of the slices is larger. We propose the representation of a dynamic object-oriented program dependence graph so as to process the slicing of object-oriented programs that is composed of related programs in order to process certain jobs. We also propose an efficient slicing algorithm using the relations of relative tables in order to compute dynamic slices of object-oriented programs. Consequently, the efficiency of the proposed efficient dynamic object-oriented program dependence graph technique is also compared with the dependence graph techniques discussed previously As a result, this is certifying that an efficient dynamic object-oriented program dependence graph is more efficient in comparison with the traditional object-oriented dependence graphs and dynamic object-oriented program dependence graph.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.9-14
• /
• 2009

In this paper, we proposed spreading code slicing technique for efficient transmitter detection in AT-DMB system with single frequency network. At the transmitter, the spreading code for transmitter identification inserted using slicing technique on forehead of null symbol and then transmitted. In this point, it requires high correlation characteristic spreading code. At the receiver, peak to peak value calculated by correlation process before signal demodulation. The transmitter information by proposed technique is employed to implement the single frequency network (SFN) which is proposed for solving a frequency inefficiency problem of the MFN. The results of the paper can be applied to wireless multimedia digital broadcasting system.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2384-2392
• /
• 1999

Software engineers are used to analyse the error behavior of computer programs using test cases which are collected for the testing phase when software errors are detected. In actual software testing and debugging, it is important to adopt dynamic slicing technique which is concerned on all the statements to be affected by the variables of current inputs and to use technique of its implementations. The traditional dynamic slicing has focused on the single slicing criterion algorithm. It has been thought that it is needed to develope and implement algorithm for used multiple criteria variables program slicing, which finds every slicing criterion variable where it is used multiple criteria variables. In this paper, we propose an efficient algorithm to make dynamic program slices when it has used multiple criteria variables. The results of the implementation are presented by the making table on execution history and the dynamic dependence graph. Also we can find that the proposed dynamic program slicing approach using multiple criteria variables is more efficient than the traditional single case algorithm on the practical testing environment.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2008.10b
• /
• pp.651-655
• /
• 2008

Traditional slicing techniques make slices through dependence graphs. They also improve the accuracy of slices. However, traditional slicing techniques require many vertices and edges in order to express a data communication links. Therefore the graph becomes complicated, and size of the slices is larger. We propose the representation of a dynamic object-oriented program dependence graph so as to process the slicing of object-oriented programs that is composed of related programs in order to process certain jobs. The efficiency of the proposed efficient dynamic object-oriented program dependence graph technique is also compared with the dependence graph techniques discussed previously. As a result, this is certifying that an efficient dynamic object-oriented program dependence graph is more efficient in comparison with the traditional dynamic object-oriented program dependence graph.

• The Journal of the Korea Contents Association
• /
• v.6 no.10
• /
• pp.114-125
• /
• 2006

In the previous work, we presented HDT for locating logical errors in Java programs. The HDT locates an erroneous method at an execution tree using an algorithmic program debugging technique and locates a statement with errors in the erroneous method using a step-wise program debugging. It reduced the number of programmer debugging in Java programs. But the HDT still increases the number of debugging because the size of the recent programs increases than the past programs and the number of methods is increasing. This paper proposes HDTS using a program slicing technique (PST) at the MDT. HDTS can reduce the number of programmer debugging. Specially, the more the number of methods and statements increases, the more HDTS has effects.

• Journal of the Korea Furniture Society
• /
• v.22 no.4
• /
• pp.270-277
• /
• 2011

This study aims to find new solutions to the problem of utilization of materials and techniques represented in the development of modern lighting design. LED is an important component in modern lighting design and pine tree is one of the most popular domestic wood in furniture design in Korea. In this study, design is developed into various types of furniture such as a table, a chest, and a lighting, by researching manufacturing process and examining the use of slicing pine tree. The technique of slicing pine tree is a simple linear arrangement that was traditionally used in wooden furniture in Lee dynasty, with an emphasis on repetitive rhythm. The slicing technology is used to expand the usage of domestic pine tree. The beauty of natural wood is expressed with the transmission of light by applying this technique to the lighting design. It also brings new communication in between artificial lighting and natural wood combining this traditional technique and LED lighting in design. Finally, this study suggests particular value through the convergence of analog and digital by using the traditional wooden technique that keeps natural wood prints and new digital technology by using LED lighting. More discussions and research about this subject are expected continuously through this study.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.1
• /
• pp.59-66
• /
• 2017

Hackers have obfuscated their malware to avoid being analyzed. Recently, obfuscation tools translate original codes into bytecodes to use virtualized-obfuscation, so that bytecodes are executed by virtual machines. In such cases, malware analysts fail to know about the malware before execution of the codes. We found that program slicing is one of promising program analysis techniques to solve this problem. The main concepts of program slice include slicing criteria given by analysts and sliced statements according to the slicing criteria. This paper proposes a deobfuscation method based on program slicing technique.

• International Journal of Precision Engineering and Manufacturing
• /
• v.8 no.3
• /
• pp.64-70
• /
• 2007

Of all the rapid tooling (RT) methods currently available, thick-layer laminated tooling is the most suitable for large-scale, low-cost dies and molds. Currently, the determination of a lamina's contour or profile and the associated slicing algorithms are based on existing rapid prototyping (RP) data manipulation technology. This paper presents a new adaptive slicing algorithm developed exclusively for profiled edge laminae (PEL) tooling PEL tooling is a thick-layer RT technique that involves the assembly of an array of laminae, whose top edges are simultaneously profiled and beveled using a line-of-sight cutting method based on a CAD model of the intended tool surface. The cutting profiles are based on the intersection curve obtained directly from the CAD model to ensure geometrical accuracy. The slicing algorithm determines the lamina thicknesses that minimize the dimensional error using a new tool shape error index. At the same time, the algorithm considers the available lamination thicknesses and desired lamina interface locations. We demonstrate the new slicing algorithm by developing a simple industrial PEL tool based on a CAD part shape.