Optimising the reliability that can be claimed for a software-based system based on failure-free tests of its components

January 30, 2022 Β· Declared Dead Β· πŸ› International Conference on Computer Safety, Reliability, and Security

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Peter Bishop, Andrey Povyakalo arXiv ID 2201.12829 Category cs.SE: Software Engineering Citations 0 Venue International Conference on Computer Safety, Reliability, and Security Last Checked 5 months ago
Abstract
This short paper describes a numerical method for optimising the conservative confidence bound on the reliability of a system based on tests of its individual components. This is an alternative to the algorithmic approaches identified in Bishop and Povyakalo (RESS 2020). For a given maximum number of component tests, the numerical method can derive an optimal test plan for any arbitrary system structure. The optimisation method is based on linear programming which is more efficient that the alternative integer programming. In addition, the optimisation process need only be performed once for any given system structure as the solution can be re-used to compute an optimal integer test plan for a different maximum number of component tests. This approach might have broader application to other optimisation problems that are normally implemented using integer programming methods.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Software Engineering

Died the same way β€” πŸ‘» Ghosted