Mathematics of Dependable Systems: Based on the Proceedings of a Conference on Mathematics of Dependable Systems, Organized by the Institute of Mathematics and Its Applications and Held at Royal Holloway, University of London, in September 1993Chris Mitchell, Victoria Stavridou Dependable systems is all about setting up controls to ensure maximum security, reliability, and safety in engineering and technology. With the increased use of computerized controls in airliners, manufacturing plants, and nuclear power stations, the topic is a significant one for computer scientists and engineers. These are the edited proceedings of the first international conference on the Mathematics of Dependable Systems, which took place at Royal Holloway, University of London in 1993. The goal of the conference was to identify unifying mathematical schemes for safety and security to enable interaction of ideas from different fields. Contributions from active researchers focus on safety-critical systems, software testing and reliability, computer security, entity authentication, formal methods, and fault tolerance. |
Contents
Simulated data experiment to test a software reliability | 1 |
the SAFEMOS project by J P Bowen | 49 |
Formal techniques for requirements analysis | 63 |
Copyright | |
9 other sections not shown
Common terms and phrases
action adequacy analysis application approach associated assume atom automaton axioms behaviour called candidate closed compiler complete Computer concepts condition considered containing correct criteria defined definition denote depends described domain Edited elected engineering errors event example execution exercise frequencies expression failure failure rate faults Figure finite formal methods formula function given implementation initial input integrity interval introduced language logic machine mapping mathematics means measurement mechanism notation Note objects occurrence rates operations output paths performed possible predicate preference present probabilistic probability problem proof properties prove reasoning refinement relation reliability represented requirements respectively result rules safety satisfies semantics specification stage statement techniques theory tion transferred transition true units University variables vector verification voting