This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Redundancy in Data Structures: Improving Software Fault Tolerance
November 1980 (vol. 6 no. 6)
pp. 585-594
D.J. Taylor, Department of Computer Science and the Computer Communications Networks Group, University of Waterloo
The increasing cost of computer system failure has stimulated interest in improving software reliability. One way to do this is by adding redundant structural data to data structures. Such redundancy can be used to detect and correct (structural) errors in instances of a data structure. The intuitive approach of this paper, which makes heavy use of examples, is complemented by the more formal development of the companion paper, "Redundancy in Data Structures: Some Theoretical Results."
Index Terms:
software reliability, Binary trees, error correction, error detection, linear lists, redundancy, robust data structures, software fault tolerance
Citation:
D.J. Taylor, D.E. Morgan, J.P. Black, "Redundancy in Data Structures: Improving Software Fault Tolerance," IEEE Transactions on Software Engineering, vol. 6, no. 6, pp. 585-594, Nov. 1980, doi:10.1109/TSE.1980.234507
Usage of this product signifies your acceptance of the Terms of Use.