• Title/Summary/Keyword: code complexity

Search Result 594, Processing Time 0.029 seconds

A Testing Method for Web-Based Banking Applications Using Formal Specification (정형 명세를 이용한 웹 기반 은행 어플리케이션의 테스트 기법)

  • Ahn, Young-Hee;Choi, Eun-Man
    • The KIPS Transactions:PartD
    • /
    • v.11D no.4
    • /
    • pp.855-864
    • /
    • 2004
  • Programmers can be got the test-related information for implementation without interference of source code complexity by use of the formal specification. Especially the external inputs and system responses can be represented precisely by formal specification in testing phase of web-based software systems. This paper suggests a method of extracting test cases by use of formal specification. Object-Z formal specification represents various test-related information for complex functions of web-based applications. State Transition Models could be built from the formal specification so that test scenarios were extracted from STDs from the highest level to detail levels. The target system for verification of this method is a web-based banking system which is necessary to be secured and critical on errors. This method would be an important factor in automatizing test procedure for web-based application software systems combining the user-base test technique.

A Study on Hybrid Fuzzing using Dynamic Analysis for Automatic Binary Vulnerability Detection (바이너리 취약점의 자동 탐색을 위한 동적분석 정보 기반 하이브리드 퍼징 연구)

  • Kim, Taeeun;Jurn, Jeesoo;Jung, Yong Hoon;Jun, Moon-Seog
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.6
    • /
    • pp.541-547
    • /
    • 2019
  • Recent developments in hacking technology are continuing to increase the number of new security vulnerabilities. Approximately 80,000 new vulnerabilities have been registered in the Common Vulnerability Enumeration (CVE) database, which is a representative vulnerability database, from 2010 to 2015, and the trend is gradually increasing in recent years. While security vulnerabilities are growing at a rapid pace, responses to security vulnerabilities are slow to respond because they rely on manual analysis. To solve this problem, there is a need for a technology that can automatically detect and patch security vulnerabilities and respond to security vulnerabilities in advance. In this paper, we propose the technology to extract the features of the vulnerability-discovery target binary through complexity analysis, and select a vulnerability-discovery strategy suitable for the feature and automatically explore the vulnerability. The proposed technology was compared to the AFL, ANGR, and Driller tools, with about 6% improvement in code coverage, about 2.4 times increase in crash count, and about 11% improvement in crash incidence.

An Empirical Evaluation of Safety of the Common Vent Structure for Stationary Fuel Cell Systems (건물용 연료전지 복합배기구조 안전 실증평가)

  • LEE, EUN-KYUNG;LEE, JUNG-WOON;MOON, JONG-SAM;LEE, SEONG-HEE;SHIN, DONG-HUN
    • Transactions of the Korean hydrogen and new energy society
    • /
    • v.29 no.6
    • /
    • pp.596-605
    • /
    • 2018
  • Interest in hydrogen, as an energy carrier, has been growing to solve the problems on shortage of fossile fuels and greenhouse gas. According to the standard KGS FU 551 for stationary fuel cell installation, the fuel cell system could be connected up to two common exhausts to one floor. depending on the required power for building or the installation environment in buildings, multiple fuel cell systems could be installed. Afterwards the number of perforations and flues could be decided. Hence, economic efficiency in significantly determined with respect to installation area and the number of fuel cell systems. In addition, the complexity of common vent structure for stationary fuel cell systems could be changed. In this paper, Verification experiments were conducted by connecting the common exhaust system to the fuel cell simulation system and the actual fuel cell system. Humidity and temperature were changed at ON/OFF, but no factors were found to affect performance or system malfunction. Exhaust emissions were also measured to obtain optimized values. We intend to expand the diffusion of stationary fuel cells by verifying safety of common exhaust structure.

Experimental research on design wind loads of a large air-cooling structure

  • Yazhou, Xu;Qianqian, Ren;Guoliang, Bai;Hongxing, Li
    • Wind and Structures
    • /
    • v.28 no.4
    • /
    • pp.215-224
    • /
    • 2019
  • Because of the particularity and complexity of direct air-cooling structures (ACS), wind parameters given in the general load codes are not suitable for the wind-resistant design. In order to investigate the wind loads of ACS, two 1/150 scaled three-span models were designed and fabricated, corresponding to a rigid model and an aero-elastic model, and wind tunnel tests were then carried out. The model used for testing the wind pressure distribution of the ACS was defined as the rigid model in this paper, and the stiffness of which was higher than that of the aero-elastic model. By testing the rigid model, the wind pressure distribution of the ACS model was studied, the shape coefficients of "A" shaped frame and windbreak walls, and the gust factor of the windbreak walls were determined. Through testing the aero-elastic model, the wind-induced dynamic responses of the ACS model was studied, and the wind vibration coefficients of ACS were determined based on the experimental displacement responses. The factors including wind direction angle and rotation of fan were taken into account in this test. The results indicated that the influence of running fans could be ignored in the structural design of ACS, and the wind direction angle had a certain effect on the parameters. Moreover, the shielding effect of windbreak walls induced that wind loads of the "A" shaped frame were all suction. Subsequently, based on the design formula of wind loads in accordance with the Chinese load code, the corresponding parameters were presented as a reference for wind-resistant design and wind load calculation of air-cooling structures.

Static Analysis and Improvement Opportunities for Open Source of UAV Flight Control Software (무인비행체 비행제어 Open Source 소프트웨어에 대한 정적분석 및 개선방안)

  • Jang, Jeong-hoon;Kang, Yu-sun;Lee, Ji-hyun
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.49 no.6
    • /
    • pp.473-480
    • /
    • 2021
  • In this paper, We analyze and present improvements to problems in software quality through Static Analysis for Open Source, which is widely used as the Flight Controller software for small unmanned aerial vehicle drones. MISRA coding rules, which are widely applied based on software quality, have been selected. Static analysis tools were used by LDRA tools certified international tools used in all industries, including automobiles, railways, nuclear power and healthcare, as well as aviation. We have identified some safety-threatening problems across the quality of the software, such as structure of open source modules, analysis of usage data, compliance with coding rules, and quality indicators (complexity and testability), and have presented improvements.

Malware Detection Using Deep Recurrent Neural Networks with no Random Initialization

  • Amir Namavar Jahromi;Sattar Hashemi
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.8
    • /
    • pp.177-189
    • /
    • 2023
  • Malware detection is an increasingly important operational focus in cyber security, particularly given the fast pace of such threats (e.g., new malware variants introduced every day). There has been great interest in exploring the use of machine learning techniques in automating and enhancing the effectiveness of malware detection and analysis. In this paper, we present a deep recurrent neural network solution as a stacked Long Short-Term Memory (LSTM) with a pre-training as a regularization method to avoid random network initialization. In our proposal, we use global and short dependencies of the inputs. With pre-training, we avoid random initialization and are able to improve the accuracy and robustness of malware threat hunting. The proposed method speeds up the convergence (in comparison to stacked LSTM) by reducing the length of malware OpCode or bytecode sequences. Hence, the complexity of our final method is reduced. This leads to better accuracy, higher Mattews Correlation Coefficients (MCC), and Area Under the Curve (AUC) in comparison to a standard LSTM with similar detection time. Our proposed method can be applied in real-time malware threat hunting, particularly for safety critical systems such as eHealth or Internet of Military of Things where poor convergence of the model could lead to catastrophic consequences. We evaluate the effectiveness of our proposed method on Windows, Ransomware, Internet of Things (IoT), and Android malware datasets using both static and dynamic analysis. For the IoT malware detection, we also present a comparative summary of the performance on an IoT-specific dataset of our proposed method and the standard stacked LSTM method. More specifically, of our proposed method achieves an accuracy of 99.1% in detecting IoT malware samples, with AUC of 0.985, and MCC of 0.95; thus, outperforming standard LSTM based methods in these key metrics.

Design of uC/OS-II Based Telemetry PCM Encoder for Effective Resource Use (효율적인 자원 활용을 위한 uC/OS-II 기반의 텔레메트리 PCM 엔코더 설계)

  • Geon-hee Kim;Bokki Kim
    • Journal of Advanced Navigation Technology
    • /
    • v.28 no.3
    • /
    • pp.315-322
    • /
    • 2024
  • In this paper, we proposes real-time operating system based PCM encoder for telemetry system that must transmit frames within a set time. In the case of large aircraft, the complexity of the system is increasing because a lot of state information is measured from each sensor and peripheral device. In addition, as the amount measurement data increases, the role of PCM encoder to transmit frames within a set time is becoming important. Existing encoder is inflexible when changing specifications or implementing additional features. Therefore, a design is needed to supplement this. We propose a PCM encoder design applying uC/OS-II. In order to confirm the validity, a simulation was performed to measure the execution time of the task to confirm the performance.

A comparison study between the realistic random modeling and simplified porous medium for gamma-gamma well-logging

  • Fatemeh S. Rasouli
    • Nuclear Engineering and Technology
    • /
    • v.56 no.5
    • /
    • pp.1747-1753
    • /
    • 2024
  • The accurate determination of formation density and the physical properties of rocks is the most critical logging tasks which can be obtained using gamma-ray transport and detection tools. Though the simulation works published so far have considerably improved the knowledge of the parameters that govern the responses of the detectors in these tools, recent studies have found considerable differences between the results of using a conventional model of a homogeneous mixture of formation and fluid and an inhomogeneous fractured medium. It has increased concerns about the importance of the complexity of the model used for the medium in simulation works. In the present study, we have suggested two various models for the flow of the fluid in porous media and fractured rock to be used for logging purposes. For a typical gamma-gamma logging tool containing a 137Cs source and two NaI detectors, simulated by using the MCNPX code, a simplified porous (SP) model in which the formation is filled with elongated rectangular cubes loaded with either mineral material or oil was investigated. In this model, the oil directly reaches the top of the medium and the connection between the pores is not guaranteed. In the other model, the medium is a large 3-D matrix of 1 cm3 randomly filled cubes. The designed algorithm to fill the matrix sites is so that this realistic random (RR) model provides the continuum growth of oil flow in various disordered directions and, therefore, fulfills the concerns about modeling the rock textures consist of extremely complex pore structures. For an arbitrary set of oil concentrations and various formation materials, the response of the detectors in the logging tool has been considered as a criterion to assess the effect of modeling for the distribution of pores in the formation on simulation studies. The results show that defining a RR model for describing heterogeneities of a porous medium does not effectively improve the prediction of the responses of logging tools. Taking into account the computational cost of the particle transport in the complex geometries in the Monte Carlo method, the SP model can be satisfactory for gamma-gamma logging purposes.

Experimental Design of S box and G function strong with attacks in SEED-type cipher (SEED 형식 암호에서 공격에 강한 S 박스와 G 함수의 실험적 설계)

  • 박창수;송홍복;조경연
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.1
    • /
    • pp.123-136
    • /
    • 2004
  • In this paper, complexity and regularity of polynomial multiplication over $GF({2^n})$ are defined by using Hamming weight of rows and columns of the matrix ever GF(2) which represents polynomial multiplication. It is shown experimentally that in order to construct the block cipher robust against differential cryptanalysis, polynomial multiplication of substitution layer and the permutation layer should have high complexity and high regularity. With result of the experiment, a way of constituting S box and G function is suggested in the block cipher whose structure is similar to SEED, which is KOREA standard of 128-bit block cipher. S box can be formed with a nonlinear function and an affine transform. Nonlinear function must be strong with differential attack and linear attack, and it consists of an inverse number over $GF({2^8})$ which has neither a fixed pout, whose input and output are the same except 0 and 1, nor an opposite fixed number, whose output is one`s complement of the input. Affine transform can be constituted so that the input/output correlation can be the lowest and there can be no fixed point or opposite fixed point. G function undergoes linear transform with 4 S-box outputs using the matrix of 4${\times}$4 over $GF({2^8})$. The components in the matrix of linear transformation have high complexity and high regularity. Furthermore, G function can be constituted so that MDS(Maximum Distance Separable) code can be formed, SAC(Strict Avalanche Criterion) can be met, and there can be no weak input where a fixed point an opposite fixed point, and output can be two`s complement of input. The primitive polynomials of nonlinear function affine transform and linear transformation are different each other. The S box and G function suggested in this paper can be used as a constituent of the block cipher with high security, in that they are strong with differential attack and linear attack with no weak input and they are excellent at diffusion.

An Efficient Array Algorithm for VLSI Implementation of Vector-radix 2-D Fast Discrete Cosine Transform (Vector-radix 2차원 고속 DCT의 VLSI 구현을 위한 효율적인 어레이 알고리듬)

  • 신경욱;전흥우;강용섬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.12
    • /
    • pp.1970-1982
    • /
    • 1993
  • This paper describes an efficient array algorithm for parallel computation of vector-radix two-dimensional (2-D) fast discrete cosine transform (VR-FCT), and its VLSI implementation. By mapping the 2-D VR-FCT onto a 2-D array of processing elements (PEs), the butterfly structure of the VR-FCT can be efficiently importanted with high concurrency and local communication geometry. The proposed array algorithm features architectural modularity, regularity and locality, so that it is very suitable for VLSI realization. Also, no transposition memory is required, which is invitable in the conventional row-column decomposition approach. It has the time complexity of O(N+Nnzp-log2N) for (N*N) 2-D DCT, where Nnzd is the number of non-zero digits in canonic-signed digit(CSD) code, By adopting the CSD arithmetic in circuit desine, the number of addition is reduced by about 30%, as compared to the 2`s complement arithmetic. The computational accuracy analysis for finite wordlength processing is presented. From simulation result, it is estimated that (8*8) 2-D DCT (with Nnzp=4) can be computed in about 0.88 sec at 50 MHz clock frequency, resulting in the throughput rate of about 72 Mega pixels per second.

  • PDF