Visible to the public Theoretical Feasibility of Statistical Assurance of Programmable Systems Based on Simulation Tests

TitleTheoretical Feasibility of Statistical Assurance of Programmable Systems Based on Simulation Tests
Publication TypeConference Paper
Year of Publication2017
AuthorsChen, L., May, J.
Conference Name2017 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)
Date Publishedjul
Keywordscomposability, continuous operation systems, empirical failure probability estimation, Emulation/Simulation-enhanced Test, Estimation, Failure Probability, Hardware, platform simulation approach, program testing, programmable systems, protection system, pubcrawl, reliability, reliability theory, Scalability, simulated hardware platform, simulation tests, Software, software assurance, software reliability, software-intensive system, statistical analysis, statistical assurance, statistical test, statistical testing, Test Time Expansion, test time expansion problem, Testing, theoretical feasibility, ultra-high reliability levels

This presents a new model to support empirical failure probability estimation for a software-intensive system. The new element of the approach is that it combines the results of testing using a simulated hardware platform with results from testing on the real platform. This approach addresses a serious practical limitation of a technique known as statistical testing. This limitation will be called the test time expansion problem (or simply the 'time problem'), which is that the amount of testing required to demonstrate useful levels of reliability over a time period T is many orders of magnitude greater than T. The time problem arises whether the aim is to demonstrate ultra-high reliability levels for protection system, or to demonstrate any (desirable) reliability levels for continuous operation ('high demand') systems. Specifically, the theoretical feasibility of a platform simulation approach is considered since, if this is not proven, questions of practical implementation are moot. Subject to the assumptions made in the paper, theoretical feasibility is demonstrated.

Citation Keychen_theoretical_2017