• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.13-21
• /
• 2010

IEEE 1149.1 test architecture was proposed to support the test of elements within the boards. It is a large serial shift register that uses the TDI pin as an input and the TDO pin as an output. Even though it performs the board level test perfectly, there is a problems of running system level test when the boards are equipped to the system. To test real time operation signal on test pin, output speed of serial shift register chain must be above double clock speed of shift register. In this paper, we designed a runtime test architecture and a runtime test procedure under running system environments to capture runtime signal at system clock rate. The suggested runtime test architecture are simulated by Altera Max+Plus 10.0. through the runtime test procedure. The simulation results show that operations of the suggested runtime test architecture are very accurate.

• Journal of Information Processing Systems
• /
• v.15 no.6
• /
• pp.1462-1471
• /
• 2019

Real-time embedded systems have become pervasive in general industry. They also began to be applied in such domains as avionics, automotive, aerospace, healthcare, and industrial Internet. However, the system failure of such domains could result in catastrophic consequences. Runtime software testing is required in such domains that demands very high accuracy. Traditional runtime software testing based on handwork is very inefficient and time consuming. Hence, test automation methodologies in runtime is demanding. In this paper, we introduce a software testing system that translates a real-time software into a monitorable real-time software. The monitorable real-time software means the software provides the monitoring information in runtime. The monitoring target are time constraints of the input real-time software. We anticipate that our system lessens the burden of runtime software testing.

• The KIPS Transactions:PartA
• /
• v.17A no.4
• /
• pp.167-172
• /
• 2010

This paper proposes a set of runtime test models for priority queues and shows the runtime test results based on the proposed test models for the representative priority queues: the traditional heap, post-order heap, and pairing heap. Among these heaps, the traditional heap is the worst in time complexity analyzed. But, according to our experimental results based on the test models proposed, it is shown that the slowest one is the pairing heap that utilizes pointers and the fastest one is the traditional heap. For the two implicit heaps, these results are in contrary to the fact that the post-order heap is better than the traditional heap in time complexity analyzed.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.3
• /
• pp.443-454
• /
• 2020

The JavaScript engine is a module that receives JavaScript code as input and processes it, among many functions that are loaded into web browsers and display web pages. Many fuzzing test studies have been conducted as vulnerabilities in JavaScript engines could threaten the system security of end-users running JavaScript through browsers. Some of them have increased fuzzing efficiency by guiding test coverage in JavaScript engines, but no coverage guided fuzzing of optimized, dynamically generated machine code was attempted. Optimized JavaScript codes are difficult to perform sufficient iterative testing through fuzzing due to the function of runtime guards to free the code in the event of exceptional control flow. To solve these problems, this paper proposes a method of performing fuzzing tests on optimized machine code by avoiding deoptimization. In addition, we propose a method to measure the coverage of runtime-guards by the dynamic binary instrumentation and to guide increment of runtime-guard coverage. In our experiment, our method has outperformed the existing method at two measures: runtime coverage and iteration by time.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2809-2822
• /
• 1998

GNARL is the runtime system of the Gun NYU Ada'95 compiler(GNAT). It implements the multi-tasking features of the Ada programming language and together they provide a freely available test-bed for experimentation in language, compiler, and runtime support for real-time programming. In this paper, we give an overview of GNAT and GNARL. We then describe the results of our research toward improving efficiency, predictability, and reliability of Ada'95 multi-tasking.

• Journal of Software Assessment and Valuation
• /
• v.17 no.2
• /
• pp.125-142
• /
• 2021

Reports of rampant cross-site scripting (XSS) vulnerabilities raise growing concerns on the effectiveness of current Static Analysis Security Testing (SAST) tools as an internet security device. Attentive to these concerns, this study aims to examine seven open-source SAST tools in order to account for their capabilities in detecting XSS vulnerabilities in PHP applications and to determine their performance in terms of effectiveness and analysis runtime. The representative tools - categorized as either text-based or graph-based analysis tools - were all test-run using real-world PHP applications with known XSS vulnerabilities. The collected vulnerability detection reports of each tool were analyzed with the aid of PhpStorm's data flow analyzer. It is observed that the detection rates of the tools calculated from the total vulnerabilities in the applications can be as high as 0.968 and as low as 0.006. Furthermore, the tools took an average of less than a minute to complete an analysis. Notably, their runtime is independent of their analysis type.

• Journal of KIISE:Software and Applications
• /
• v.37 no.10
• /
• pp.760-767
• /
• 2010

There are many memory leak detection tools. However, programmers, who develop very large programs, tend to avoid testing their programs with memory leak detection tools since these tools require runtime and space overheads. Thus, we present a memory leak detection technique which enables programmers to test their modules in their unit test phase with low overheads. To achieve this goal, we extend the existing cyclic memory allocation technique and evaluate our memory leak detection technique on a tiny DBMS. In our experiments, we find our tool has reasonably low runtime and space overheads and it reports only a small number of false positives.

• International Journal of Computer Science & Network Security
• /
• v.23 no.1
• /
• pp.103-111
• /
• 2023

Implementing conventional DFT solution for arrays of DNN accelerators having large number of processing elements (PEs), without considering architectural characteristics of PEs may incur overwhelming test overheads. Recent DFT based techniques have utilized the homogeneity and dataflow of arrays at PE-level and Core-level for obtaining reduction in; test pattern volume, test time, test power and ATPG runtime. This paper reviews these contemporary test solutions for ASIC based DNN accelerators. Mainly, the proposed test architectures, pattern application method with their objectives are reviewed. It is observed that exploitation of architectural characteristic such as homogeneity and dataflow of PEs/ arrays results in reduced test overheads.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.21 no.6
• /
• pp.8-15
• /
• 2013

Wide range frequency pulses occur in a car crash test. Until now, low frequency under 400Hz has been used to determine an airbag deployment criteria. Also, FIS (Front Impact Sensor) has been used to detect the crash pulse in early stage. Nowadays, technology to determine an airbag delpoyment criteria by using a high frequency crash pulse without FIS is being focused on. In this paper, the signal transmissibility of high frequency pulse for two different cars was studied. Also, signal transfer test of high frequency pulse was done by using a high speed ball impact. Signal runtime of the frontal impact is compared with that of the side impact. The signal transmissibility difference due to the car structure difference was discussed and structure change for improving the signal transmissibility was proposed.

• Proceedings of the PSK Conference
• /
• 2003.10b
• /
• pp.185.2-185.2
• /
• 2003

The typical approach of virtual screening is to prepare a 3D database and dock each member to the receptor, and carry out a post-analysis to make a final selection of compounds to be tested. The biological test of these compounds leads to 'hit'. The size of the 3D database is rate-determining factor because the docking process is still time-consuming method. The number of compounds for biological testing is cost-determining factor because the materials used in the test are cost-consuming. The use of the representative subsets derived from the entire database help reduce runtime of docking procedure. (omitted)