Relational characterizations of system fault tolerance

  • Authors:
  • V. Cortellessa;D. Del Gobbo;M. Shereshevsky;J. Desharnais;A. Mili

  • Affiliations:
  • Dipartimento di Informatica, Universita dell'Aquila, L'Aquila, Italy and Department of Computer Science, University of Aquila, L'Aquila, Italy;Lane Department of Computer Science and Electrical Engineering, West Virginia University, Morgantown, WV;Lane Department of Computer Science and Electrical Engineering, West Virginia University, Morgantown, WV;Département d'informatique et de génie logiciel, Université Laval, Québec, Canada;College of Computing Science, New Jersey Institute of Technology, Newark, NJ

  • Venue:
  • Science of Computer Programming
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Fault tolerance is the ability of a system to continue delivering its services after faults have caused errors. We have argued, in the past, that complex and/or critical systems are best validated by a wide range of methods, including proving, testing, and fault tolerance; we have also argued that in order to use these methods in concert, we need to cast them in a common framework. In this paper, we present mathematical characterizations of fault tolerance properties, using a relational calculus.