Estimating Worst Case Failure Dependency with Partial Knowledge of the Difficulty Function

Bishop, P. G. & Strigini, L. (2014). Estimating Worst Case Failure Dependency with Partial Knowledge of the Difficulty Function. Paper presented at the 33rd International Conference, SAFECOMP 2014, 10-09-2014 - 12-09-2014, Florence, Italy.

[img]
Preview
Text - Accepted Version
Download (135kB) | Preview

Abstract

For systems using software diversity, well-established theories show that the expected probability of failure on demand (pfd) for two diverse program versions failing together will generally differ from what it would be if they failed independently. This is explained in terms of a “difficulty function” that varies between demands on the system. This theory gives insight, but no specific prediction unless we have some means to quantify the difficulty func-tion. This paper presents a theory leading to a worst case measure of “average failure dependency” between diverse software, given only partial knowledge of the difficulty function. It also discusses the possibility of estimating the model parameters, with one approach based on an empirical analysis of previous sys-tems implemented as logic networks, to support pre-development estimates of expected gain from diversity. The approach is illustrated using a realistic safety system example.

Item Type: Conference or Workshop Item (Paper)
Additional Information: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-10506-2_13
Uncontrolled Keywords: safety, software reliability, fault tolerance, failure dependency, software diversity, difficulty function
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: School of Informatics > Centre for Software Reliability
URI: http://openaccess.city.ac.uk/id/eprint/12850

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics