Nontrivial Models in Debugging Theory. Part 2

      Аннотация: The great research interest and construction of new modified models in the field of debugging and test theories provoked the emergence of this second volume dedicated to the detailed study and real-life test of these methods. An important measure of reliability assessment (completeness, accuracy and consistency) is the so-called metric (asymptotic metrics). A Hausdorff metric was chosen to evaluate the test data which are fitted to the sigmoid models proposed in this book. We illustrate the possibility of equitable use of the new characteristic “supersaturation” in combination with established characteristics - confidence intervals and bounds. Some of the existing nontrivial cumulative probability distributions are considered in the light of modern debugging and test theories. We propose a software modules within the programming environment CAS Mathematica for the analysis.

Ключевые слова: confidence bounds, cumulative number of failures, debugging theory, Hausdorff Distance, uniform distance, “supersaturation”, Chang-Pham-Lee-Song model, extended Song-Chang-Pham model, K-stage Erlangian growth curve, Dagum and Dagum-II models, Ohba’s inflexion S-shaped model, deterministic curve models, Software Reliability Models, transmuted deterministic, transmuted exponential, transmuted log-logistic