• Journal of Software Assessment and Valuation
• /
• v.16 no.2
• /
• pp.45-52
• /
• 2020

Traditional methods of detecting security vulnerabilities in source-code require a lot of time and effort. If there is good data, the issue could be solved by using the data with machine learning. Thus, this paper proposes a source-code vulnerability detection method based on machine learning. Our method employs the code2vec model that has been used to propose the names of methods, and uses as a data set, Juliet Test Suite that is a collection of common security vulnerabilities. The evaluation shows that our method has high precision of 97.3% and recall rates of 98.6%. And the result of detecting vulnerabilities in open source project shows hopeful potential. In addition, it is expected that further progress can be made through studies covering with vulnerabilities and languages not addressed here.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.15 no.6
• /
• pp.38-46
• /
• 2011

In order to simulate the ignition-gas injection in the interior ballistics, a two-dimensional analytic code for two-phase flows has been developed. The Eulerian-Lagrangian approach and the low-dissipation simple high-resolution upwind scheme(LSHUS) have been adopted in the numerical code for the propellant combustion of the gun propelling charges. The ghost-cell extrapolation method has been used for the moving boundary in the chamber with the projectile movement. The calculation results of the developed code have been compared and verified through those of the dimensionless IBHVG2 code and the previous one-dimensional code. In comparison with the two-phase flows according to the drag models, the numerical analysis of the muzzle velocity has been affected by the drag model.

• Proceedings of the KSME Conference
• /
• 2005.11a
• /
• pp.64.2-64.2
• /
• 2005

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.8
• /
• pp.868-872
• /
• 2010

Many embedded Java systems are equipped with limited memory, which can constrain the code cache size provided for Java just-in-time compilation, affecting the Java performance. This paper proposes expanding the limited code cache when it is full, by saving the machine code for some methods in the code cache into the file system of the permanent storage and reloading it to the code cache when they are re-invoked later. This is applying the client ahead-of-time compilation during the execution time for the purpose of enlarging the code cache. Our experimental results indicate that the proposed execution method can improve the performance by as much as 1.6 times compared to the conventional method, when the code cache size is reduced by half.

• The KIPS Transactions:PartD
• /
• v.15D no.6
• /
• pp.825-840
• /
• 2008

Refactoring is a kind of software modification process that improves system qualities internally but maintains system functions externally. What should be improved on the existing source codes should take precedence over the others in such a modification process using this refactoring. Martin Fowler and Kent Beck proposed a method that identifies code smells for this purpose. Also, some studies on determining what refactoring will be applied to which targets through detecting code smells in codes were presented. However, these studies have a lot of disadvantages that show a lack of precise description for such code smells and detect limited code smells only. In addition, these studies showed other disadvantages that generate ambiguity in behavior preservation due to the fact that a description method of pre-conditions for the behavior preservation is included in a refactoring process or unformalized. Thus, our study represents a precise specification of code smells using OCL and proposes a framework that performs a refactoring process through the automatic detection of code smells using an OCL interpreter. Furthermore, we perform the automatic detection in which the code smells are be specified by using OCL to the java program and verify its applicability and effectivity through applying a refactoring process.

• Journal of Software Assessment and Valuation
• /
• v.16 no.1
• /
• pp.37-44
• /
• 2020

The similarity of the software is extracted by the verification of comparing with the source code. The source code is the intellectual copyright of the developer written in the programming language. And the source code written in text format contains the contents of the developer's expertise and ideas. The verification for judging the illegal use of software copyright is performed by comparing the structure and contents of files with the source code of the original and the illegal copy. However, there is hard to do the one-to-one comparison in practice. Cause the suspected source code do not submitted Intentionally or unconsciously. It is now increasing practically. In this case, the comparative evaluation with execution code should be performed, and indirect methods such as reverse assembling method, reverse engineering technique, and sequence analysis of function execution are applied. In this paper, we analyzed the effectiveness of indirect comparison results by practical evaluation . It also proposes a method to utilize to the system and executable code files as a verification results.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.1
• /
• pp.108-114
• /
• 1988

We have developed a program that minimizes the chip area with effective code assignment of microinstructions when the control part of VLSI system is implemented in the PLA. While conventional algorithms are composed of one pass, the algorithm proposed in this paper is composed of two passes and it consists of three principal procedures: a procedure for the determination of the code assignment order, a procedure for the code assignment and a procedure for the reduction of the code length. especially, we have proposed a new method of folding back for the reduction of the code length. We have obtained the result of 4 bit code length and 9 product terms when 11 micro-instructions and 6 microoperations were given as a inputs. Therefore, we have certified that it could be used efficiently for the control part of the processors.

• Journal of computational fluids engineering
• /
• v.21 no.3
• /
• pp.89-97
• /
• 2016

In this study, direct code coupling, in which two codes share a single flow field, was conducted using 3-dimensional high resolution thermal hydraulics code, CUPID and 1-dimensional system analysis code, MARS. This approach provide the merit to use versatile capability of MARS for nuclear power plants and 3-dimensional T/H analysis capability of CUPID. Numerical Method to directly couple CUPID and MARS was described in this paper. The straight flow and manometer flow oscillation were calculated to verify conservation of coupled CUPID/MARS code in mass, momentum, and energy. This verification calculations indicates that the CUPID/MARS is coupled appropriately in numerical aspect and the coupled code can be applied to nuclear reactor thermal hydraulics after validation against integral transient experiments.

• Nuclear Engineering and Technology
• /
• v.45 no.5
• /
• pp.665-674
• /
• 2013

This paper presents the development and validation methods of the FUTURE (FUel cycle analysis Tool for nUcleaR Energy) code, which was developed for a dynamic material flow evaluation and economic analysis of the nuclear fuel cycle. This code enables an evaluation of a nuclear material flow and its economy for diverse nuclear fuel cycles based on a predictable scenario. The most notable virtue of this FUTURE code, which was developed using C# and MICROSOFT SQL DBMS, is that a program user can design a nuclear fuel cycle process easily using a standard process on the canvas screen through a drag-and-drop method. From the user's point of view, this code is very easy to use thanks to its high flexibility. In addition, the new code also enables the maintenance of data integrity by constructing a database environment of the results of the nuclear fuel cycle analyses.

• ETRI Journal
• /
• v.28 no.2
• /
• pp.227-230
• /
• 2006

There has been a growing need for increased capacity in cellular systems. This has resulted in the adoption of the code division multiple access (CDMA) system as a multiple channel access method. Thus, it is important to obtain the phase offsets of binary codes in the CDMA system because distinct phase offsets of the same code are used to distinguish signals received at the mobile station from different base stations. This letter proposes an efficient algorithm to compute the phase offset of a binary code in the CDMA system through the use of the basic facts of number theory and a new notion of the subcodes of a given code. We also formulate the algorithm in a compact form.