• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.750-757
• /
• 1999

The protocol conformance testing is to check whether an implementation of a protocol conforms to its specification. And it is important to improve the interoperability of protocol and the efficiency of cost. In general, protocol is composed of the control flow representing observable behaviors and the data flow representing internally used variables. Until now, research for generation of test suite has been realized only consideration the control flow of protocol or separation control flow from data flow. Case of considering control flow, contents of test was simple and definite. Length of test was short. But it was of little application, and it didn't manage each kind errors in data flow. Therefore, we must generate test case that can manage control and data flow. So, anomaly of variable must be removed for efficient conformance testing. Therefore in this dissertation, we proposed algorithm which can remove anomaly of variable for efficient conformance testing. And it showed that anomaly of variable was got rid of applying this algorithm to real protocol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.1
• /
• pp.156-163
• /
• 2006

The objective of this paper is to evaluate the performance of an operating system for embedded devices to that of the commercially available Windows platform. Analysis includes benchmarking the operating systems using a 'typical' PC workload, as well as identifying low-level areas in which the updated OS is limiting or enhancing the system performance. The primary benchmarking suites selected for this paper are 'WinStone' and 'HBench', with the former providing an application-based suite of tests and the latter providing the most direct means for isolating operating system effects on the system. We have demonstrated in a case study for embedded microprocessors, and evaluated a Windows platform at a low-level test as well as an application level using a benchmarking suite.

• Structural Engineering and Mechanics
• /
• v.9 no.6
• /
• pp.601-613
• /
• 2000

Existing models for the shear strength degradation of reinforced concrete members present varied conceptual approaches to interpreting test data. The relative superiority of one approach over the others is difficult to determine, particularly given the sparseness of ideal test data. Nevertheless, existing models are compared using a suite of test data that were used for the development of one such model, and significant differences emerge. Rather than relying purely on column test data, the body of knowledge concerning degradation of concrete as a material is considered. Confined concrete relations are examined to infer details of the degradation process, and to establish a framework for developing phenomenologically-based models for shear strength degradation in reinforced concrete members. The possibility of linking column shear strength degradation with material degradation phenomena is explored with a simple model. The model is applied to the results of 7 column tests, and it is found that such a link is sustainable. It is expected that models founded on material degradation phenomena will be more reliable and more broadly applicable than the current generation of empirical shear strength degradation models.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.280-290
• /
• 1997

The Single TTCN has been broadly used to describe the ATS(Abstract Test Suite) for the protocol confronance testing. But if the single TTCN is used to test the multi-party protocol with the non-deterministic factors, then huge amount of test notations are needed and also it is hard to understand the ATS. Therefore, the concurrent TTCN was proposed to solve these problems and the study in progress. In this paper, we did investigate and compare the characteristics of esisting single TTCN with those of the concurrent TTCN. In order to develop the ATS of the Q.2971 which is B-ISDN call/connection control protocol, the testing model was defined and the concurrent factors were extracted according to that model. As a result, we could verify the usefulness of the confcurrent TTCN.

• Korean Journal of Cognitive Science
• /
• v.12 no.4
• /
• pp.11-27
• /
• 2001

Machine translation (MT) quality assessment is an outstanding problem. In the present situation in which the quality of machine-translated products are far from the user\\`s satisfaction objective evaluation of MT system is a prerequisite to building mutual trust between the users and the vendors stimulating constructive competition among the developers and finally leading to improve the quality of MT systems. Especially there emerges a need for an intensive study on how to evaluate the quality of MT systems from both linguistic and data processing aspects and to secure a steady improvement of the translation quality. With due regard to such points we in this paper present a linguistic evaluation of English-to-Korean machine translation based on a test suite composed of 3.373 sentences that were classified into their linguistic phenomena and complexity levels and report the experimental results made from several commercial MT systems.

• 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.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.75-77
• /
• 2006

In this paper, the technology of the conformance test for Broadcast Web Site Service (BWS) which is one of the data services of the T-DMB (Terrestrial Digital Multimedia Broadcasting) is proposed. First, the standard of the BWS Service is introduced and then the method of the conformance test of BWS bitstream and BWS receiver module is provided. A BWS bitstream analyzer is implemented for use in verifying the transmitted BWS bitstreams. To provide a means for the receiver manufactures to verify their own BWS receiver modules, a receiver test suite is developed including BWS test bitstreams and a BWS reference receiver module. The BWS bitstream analyzer includes the analysis function for the conformance test of MOT protocol, HTML, PNG, MNG, JPEG, and Ecma Script. Also, it was actually used for verifying the BWS test bitstreams. In the course of developing a HWS receiver module, 4he BWS receiver module under test can be verified by comparing the results of the BWS reference receiver module with those of the receiver module under test. when the same BWS test bitstreams are fed into the two receiver modules.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.932-951
• /
• 2021

The effectiveness of testing in Model-based Testing (MBT) for Software Product Line (SPL) can be achieved by considering fault detection in test case. The lack of fault consideration caused test case in test suite to be listed randomly. Test Case Prioritization (TCP) is one of regression techniques that is adaptively capable to detect faults as early as possible by reordering test cases based on fault detection rate. However, there is a lack of studies that measured faults in MBT for SPL. This paper proposes a Test Case Prioritization (TCP) approach based on dissimilarity and string based distance called Last Minimal for Local Maximal Distance (LM-LMD) with Dice-Jaro-Winkler Dissimilarity. LM-LMD with Dice-Jaro-Winkler Dissimilarity adopts Local Maximum Distance as the prioritization algorithm and Dice-Jaro-Winkler similarity measure to evaluate distance among test cases. This work is based on the test case generated from statechart in Software Product Line (SPL) domain context. Our results are promising as LM-LMD with Dice-Jaro-Winkler Dissimilarity outperformed the original Local Maximum Distance, Global Maximum Distance and Enhanced All-yes Configuration algorithm in terms of Average Fault Detection Rate (APFD) and average prioritization time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1423-1434
• /
• 1991

This paper extends TTCN, a conformance test notation, using object oriented concepts including object, class and inheritance. In distributed system environments, since test systems that should test the implementations for application protocols whether they conform to the standard protocol include protocol test behaviours executed in parallel, the converntional TTCN can't describe whole thest suites explicitly. ISO is working the extension of TTCN including parallel notations, but concurrently if TTCN could be applied by the object model that regards a parallel test component as a object, we would gain the advantages of reliability and software reusability, and make TTCN a test language.

• KIISE Transactions on Computing Practices
• /
• v.21 no.7
• /
• pp.476-481
• /
• 2015

We have parallelized the cumulative sum (CUSUM) test of NIST's statistical random number test suite in a CUDA environment. Storing random walks in an array instead of in scalar variables eliminates data dependence. The change in data structure makes it possible to apply parallel scans, scatters, and reductions at each stage of the test. In addition, serial data exchanges between CPU and GPU are removed by migrating CPU's tasks to GPU. Finally we have optimized global memory accesses. The overall speedup is 23 times over the sequential version. Our results contribute to improving security of random numbers for cryptographic keys as well as reducing the time for evaluation of randomness.