Skip to main content

A Formal Basis for Some Dependability Notions

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2757))

Abstract

This paper shows how formal methods ideas can be used to clarify basic notions used in the field of dependability. Central to this endeavour is fixing a notion of system. Relationships between systems are also considered: in particular, the importance of the situation where one system is generated by another (possibly human) system is explored. The formalisation is used as a basis for definitions of the notions of fault, error and failure. Some applications to examples from the dependability literature and extensions of the basic model of system are also sketched.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abrial, J.-R.: The B-Book: Assigning programs to meanings. Cambridge University Press, Cambridge (1996)

    Book  MATH  Google Scholar 

  2. Astesiano, E., Kreowski, H.-J., Krieg-Bruckner, B. (eds.): Algebraic Foundations of Systems Specification. Springer, Heidelberg (1999)

    Google Scholar 

  3. America, P.: Issues in the design of a parallel object-oriented language. Formal Aspects of Computing 1(4) (1989)

    Google Scholar 

  4. Collette, P.: Design of Compositional Proof Systems Based on Assumption-Commitment Specifications – Application to UNITY. PhD thesis, Louvain-la-Neuve (June 1994)

    Google Scholar 

  5. de Roever, W.P.: Concurrency Verification: Introduction to Compositional and Noncompositional Methods. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  6. Hayes, I. (ed.): Specification Case Studies, 2nd edn. Prentice Hall International, Englewood Cliffs (1993)

    MATH  Google Scholar 

  7. Jones, C.B.: Specification and design of (parallel) programs. In: Proceedings of IFIP 1983, pp. 321–332. North-Holland, Amsterdam (1983)

    Google Scholar 

  8. Jones, C.B.: Program specification and verification in VDM. In: Broy, M. (ed.) Theory of Program Structures. NATO ASI Series F: Computer and Systems Sciences, vol. 36, pp. 149–184. Springer, Heidelberg (1987)

    Google Scholar 

  9. Jones, C.B.: Data reification. In: McDermid, J.A. (ed.) The Theory and Practice of Refinement, Butterworths, pp. 79–89 (1989)

    Google Scholar 

  10. Jones, C.B.: Systematic Software Development using VDM, 2nd edn. Prentice Hall International, Englewood Cliffs (1990) ISBN 0-13-880733-7

    MATH  Google Scholar 

  11. Jones, C.B.: Process algebra arguments about an object-based design notation. In: Roscoe, A.W. (ed.) A Classical Mind. ch. 14, pp. 231–246. Prentice-Hall, Englewood Cliffs (1994)

    Google Scholar 

  12. Jones, C.B.: Scientific decisions which characterise VDM. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol. 1708, pp. 28–47. Springer, Heidelberg (1999)

    Google Scholar 

  13. Jones, C.B.: Compositionality, interference and concurrency. In: Davies, J., Roscoe, B., Woodcock, J. (eds.) Milennial Perspectives in Computer Science, pp. 175–186. Macmillian Press (2000)

    Google Scholar 

  14. Jones, C., Romanovsky, A., Welch, I.: A structured approach to handling on-line interface upgrades. In: Proceedings of COMPSAC (2002) (to appear in)

    Google Scholar 

  15. Kopetz, H.: On the specification of linking interfaces in distributed real-time systems. Technical Report 2002/8, Institut fuer Technische Informatik, TU Vienna (2002)

    Google Scholar 

  16. Kopetz, H.: Real-Time Systems. Kluwer, Dordrecht (2002)

    Google Scholar 

  17. Laprie, J.-C.: Dependability: basic concepts and terminology—in English, French, German, Italian and Japanese. Springer, Heidelberg (1992)

    MATH  Google Scholar 

  18. Levenson, N.G., Turner, C.S.: An investigation of the Therac-25 accidents. Computer, 18–41 (July 1993)

    Google Scholar 

  19. Marshall, L.S.: A Formal Description Method for User Interfaces. PhD thesis, University of Manchester (1986)

    Google Scholar 

  20. Mahony, B., Hayes, I.: Using continuous real functions to model timed histories. In: Bailes, P. (ed.) Engineering Safe Software, pp. 257–270. Australian Computer Society (1991)

    Google Scholar 

  21. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Information and Computation 100, 1–77 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  22. Nipkow, T.: Non-deterministic data types: Models and implementations. Acta Informatica 22, 629–661 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  23. Nipkow, T.: Behavioural Implementation Concepts for Nondeterministic Data Types. PhD thesis, University of Manchester (May 1987)

    Google Scholar 

  24. Perrow, C.: Normal Accidents. Princeton University Press, Princeton (1999)

    Google Scholar 

  25. Randell, B.: Facing up to faults. The Computer Journal 43(2), 95–106 (2000)

    Article  Google Scholar 

  26. Reason, J.: Human Error. Cambridge University Press, Cambridge (1990)

    Google Scholar 

  27. Reason, J.: Managing the Risks of Organisational Accidents. Ashgate Publishing Limited (1997)

    Google Scholar 

  28. Rushby, J.: Using model checking to help discover mode confusions and other automation surprises. In: Proceedings of 3rd Workshop on Human Error, HESSD 1999, pp. 1–18 (1999)

    Google Scholar 

  29. Sangiorgi, D.: Typed π-calculus at work: a correctness proof of Jones’s parallelisation transformation on concurrent objects. Theory and Practice of Object Systems 5(1), 25–34 (1999)

    Article  MathSciNet  Google Scholar 

  30. Sala-Oliveras, C.: Systems, advisory systems and safety (2002) Private communication

    Google Scholar 

  31. Stirling, C.: A generalisation of Owicki-Gries’s Hoare logic for a concurrent while language. TCS 58, 347–359 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  32. Stølen, K.: Development of Parallel Programs on Shared Data-Structures. PhD thesis, Manchester University, available as UMCS-91-1-1 (1990)

    Google Scholar 

  33. Sangiorgi, D., Walker, D.: The π-calculus: A Theory of Mobile Processes. Cambrisge University Press, Cambridge (2001)

    Google Scholar 

  34. Walker, D.: π-calculus semantics for object-oriented programming languages. In: Ito, T., Meyer, A.R. (eds.) TACS 1991. LNCS, vol. 526, pp. 532–547. Springer, Heidelberg (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jones, C.B. (2003). A Formal Basis for Some Dependability Notions. In: Aichernig, B.K., Maibaum, T. (eds) Formal Methods at the Crossroads. From Panacea to Foundational Support. Lecture Notes in Computer Science, vol 2757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40007-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-40007-3_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20527-2

  • Online ISBN: 978-3-540-40007-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics