Skip to main content

Advertisement

Log in

Recoverability preservation: a measure of last resort

  • Published:
Innovations in Systems and Software Engineering Aims and scope Submit manuscript

Abstract.

Recoverability preservation is the property of a system to maintain recoverability even when it does not maintain correctness; recoverability, in turn, is the property of a system to avoid failure, even when system states have errors. In this paper, we argue that fault tolerance techniques could be more streamlined, less intrusive, and more effective if they focused on the criterion of recoverability preservation instead of the traditional criterion of correctness preservation. To this effect, we briefly introduce, motivate, illustrate, and analyze the concept of recoverability preservation, then we explore some of its applications.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Backhouse R, DeBruin P, Malcolm G, Voermans E, Van der Woude J (1990) A relational theory of data types. In: Proceedings of the workshop on constructive algorithms: the role of relations in program development, Hollum Ameland, Holland

  2. Berghammer R, Schmidt G, Zierer H (1986) Symmetric quotients. Technical Report TUM-I8620, Technische Universität München, Munich

  3. Berghammer R, Schmidt G, Zierer H (1989) Symmetric quotients and domain constructions. Inf Process Lett 33:163–168

    Google Scholar 

  4. Berghammer R, Schmidt G (1993) Relational specifications. In: Rauszer C (ed) Proccedings of the XXXVIII Banach Center semester on algebraic methods in logic and their computer science applications. Banach, vol 28, Warsaw, Poland, pp 167–190

  5. Birkhoff G (1967) Lattice theory. American Mathematical Society, Providence

  6. Brink Ch, Kahl W, Schmidt G (1997) Relational methods in computer science. Springer, Berlin Heidelberg New York

  7. Cortellessa V, Mili A, Cukic B, Del Gobbo D, Napolitano M, Shereshevsky M (2000) Certifying adaptive flight control software. In: Proceedings of ISACC 2000: the software risk management conference, Reston, VA

  8. DelGobbo D, Shereshevsky M, Cortellessa V, Desharnais J, Mili A (2005) A relational characterization of system fault tolerance. Science of computer programming (in press)

  9. Desharnais J, Jaoua A, Mili F, Boudriga N, Mili A (1993) A relational division operator: the conjugate kernel. Theor Comput Sci 114:247–272

    Google Scholar 

  10. Del Gobbo D, Cukic B (2001) Validating on-line neural networks. Technical report, Lane Department of Computer Science and Electrical Engineering, West Virginia University, Morgantown, WV

  11. Del Gobbo D, Mili A (2001) Re-engineering fault tolerant requirements: a case study in specifying fault tolerant flight control systems. In: Proceedings of the 5th IEEE international symposium on requirements engineering, Toronto, pp 236–247

  12. Hoare CAR, Hayes IJ, He JF, Morgan C, Roscoe AW, Sanders JW, Sorenson IH, Spived JM, Sufrín B (1987) Laws of programming. Commun ACM 30(8):672–686

    Google Scholar 

  13. Hoare CAR, He JF (1986) The weakest prespecification. Fundamentae Informaticae IX: Part I: pp 51–58. Part II: pp 217–252

  14. Jónsson B (1982) Varieties of relational algebras. Algebra Universalis 15:273–298

    Google Scholar 

  15. Josephs MB (1987) An introduction to the theory of specification and refinement. Technical Report RC 12993, IBM Corporation, Yorktown Heights, NY, USA

  16. Laprie JC (1995) Dependability – its attributes, impairments and means. In: Predictably dependable computing systems. Springer, Berlin Heidelberg New York, pp 1–19

  17. Lowry M, Boyd M, Kulkarni D (1998) Towards a theory for integration of mathematical verification and empirical testing. In: Proceedings of the 13th IEEE international conference on automated software engineering, Honolulu IEEE Computer Society, pp 322–331

  18. Mili A, Cukic B, Xia T, Ben Ayed R (1999) Combining fault avoidance, fault removal and fault tolerance: an integrated model. In: Proceedings of the 14th IEEE international conference on automated software engineering, Cocoa Beach IEEE Computer Society, pp 137–146

  19. Mills HD, Dyer M, Linger R (1987) Cleanroom software engineering. IEEE Softw 4(5):19–25

    Google Scholar 

  20. Mills HD, Linger RC, Hevner AR (1985) Principles of information systems analysis and design. Academic, New York

  21. Parnas D (2004) Private correspondence. Technical report, University of Limerick, Ireland

  22. Schmidt G, Stroehlein T (1990) Relationen und Graphen. Springer, Berlin Heidelberg New York

  23. Schmidt G, Stroehlein T (1993) Relations and graphs, discrete mathematics for computer scientists. EATCS Monographs on theoretical computer science. Springer, Berlin Heidelberg New York

  24. Selding PB (1996) Faulty software caused ariane 5 failure. Space News 7(25)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ali Mili.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mili, A., Sheldon, F., Mili, F. et al. Recoverability preservation: a measure of last resort. Innovations Syst Softw Eng 1, 54–62 (2005). https://doi.org/10.1007/s11334-005-0004-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11334-005-0004-2

Keywords