scholarly journals Two-Dimensional Software Defect Models with Test Execution History

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Tomotaka Ishii ◽  
Tadashi Dohi

In general, the software-testing time may be measured by two kinds of time scales: calendar time and test execution time. In this paper, we develop two-dimensional software reliability models with two-time measures and incorporate both of them to assess the software reliability with higher accuracy. Since the resulting software defect models are based on the familiar nonhomogeneous Poisson processes with two time scales, which are the natural extensions of one-dimensional software defect models, it is possible to treat the time data both simultaneously and effectively. We investigate the dependence of test-execution time as a testing effort on the software reliability assessment and validate quantitatively the software defect models with two-time scales. We also consider an optimization problem when to stop the software testing in terms of two-time measurements.

Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 791
Author(s):  
Willem Dirk van Driel ◽  
Jan Willem Bikker ◽  
Matthijs Tijink ◽  
Alessandro Di Bucchianico

It is known that quantitative measures for the reliability of software systems can be derived from software reliability models, and, as such, support the product development process. Over the past four decades, research activities in this area have been performed. As a result, many software reliability models have been proposed. It was shown that, once these models reach a certain level of convergence, it can enable the developer to release the software and stop software testing accordingly. Criteria to determine the optimal testing time include the number of remaining errors, failure rate, reliability requirements, or total system cost. In this paper, we present our results in predicting the reliability of software for agile testing environments. We seek to model this way of working by extending the Jelinski–Moranda model to a “stack” of feature-specific models, assuming that the bugs are labeled with the features they belong to. In order to demonstrate the extended model, two use cases are presented. The questions to be answered in these two cases are: how many software bugs remain in the software and should one decide to stop testing the software?


Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 985
Author(s):  
Hiroyuki Okamura ◽  
Tadashi Dohi

Software reliability models (SRMs) are widely used for quantitative evaluation of software reliability by estimating model parameters from failure data observed in the testing phase. In particular, non-homogeneous Poisson process (NHPP)-based SRMs are the most popular because of their mathematical tractability. In this paper, we focus on the parameter estimation algorithm for NHPP-based SRMs and discuss the EM algorithm for generalized fault count data. The presented algorithm can be applied for failure time data, failure count data, and their mixture. The paper derives the EM-step formulas for basic 12 NHPP-based SRMs and demonstrate a numerical experiment to present the convergence property of our algorithms. The developed algorithms are suitable for an automatic tool for software reliability evaluation.


Electronics ◽  
2020 ◽  
Vol 9 (5) ◽  
pp. 797 ◽  
Author(s):  
Bongjoo Koo ◽  
Jungho Bae ◽  
Seogbong Kim ◽  
Kangmin Park ◽  
Hyungshin Kim

Finite-state machines (FSMs) and the W method have been widely used in software testing. However, the W method fails to detect post-processing errors in the implementation under test (IUT) because it ends testing when it encounters a previously visited state. To alleviate this issue, we propose an enhanced fault-detection W method. The proposed method does not stop the test, even if it has reached a previously visited state; it continues to test and check the points that the W method misses. Through various case studies, we demonstrated software testing using the W method and the proposed method. From the results, it can be inferred that the proposed method can more explicitly determine the consistency between design and implementation, and it is a better option for testing larger software. Unfortunately, the testing time of the proposed method is approximately 1.4 times longer than that of the W method because of the added paths. However, our method is more appropriate than the W method for software testing in safety-critical systems, even if this method is time consuming. This is because the error-free characteristics of a safety-critical system are more important than anything else. As a result, our method can be used to increase software reliability in safety-critical embedded systems.


Author(s):  
SHINJI INOUE ◽  
KEISUKE FUKUMA ◽  
SHIGERU YAMADA

Most of software reliability growth models (SRGMs) describe a software reliability growth process depending on only testing-time. However, it is said that a software reliability growth process in an actual testing-phase of a software development process depends on not only testing-time but also testing-effort factors. And we often observe a phenomenon that stochastic characteristics of the software failure-occurrence time or the software failure-occurrence time-interval changes notably in an actual testing-phase. The testing-time when such phenomenon is observed is called change-point. It is said that the effect of change-point on the software reliability growth process influences accuracy for software reliability assessment based on conventional SRGMs. This paper discusses a two-dimensional software reliability growth modeling with change-point for describing an actual phenomenon being related to the software reliability growth process. Further, we show examples of the applications of software reliability assessment based on our two-dimensional SRGM by using actual data.


2018 ◽  
Vol 30 (3) ◽  
pp. 328-338 ◽  
Author(s):  
Maria Bertling ◽  
Jonathan P. Weeks

2019 ◽  
Vol 28 (06) ◽  
pp. 1950106
Author(s):  
Qian Dong ◽  
Bing Li

The hardware-based dictionary compression is widely adopted for high speed requirement of real-time data processing. Hash function helps to manage large dictionary to improve compression ratio but is prone to collisions, so some phrases in match search result are not true matches. This paper presents a novel match search approach called dual chaining hash refining, which can improve the efficiency of match search. From the experimental results, our method showed obvious advantage in compression speed compared with other approach that utilizes single hash function described in the previous publications.


Sign in / Sign up

Export Citation Format

Share Document