Certification Trails for Data Structures (1991)
| Venue: | Digest of the 1991 Fault Tolerant Computing Symposium |
| Citations: | 21 - 8 self |
BibTeX
@INPROCEEDINGS{Sullivan91certificationtrails,
author = {Gregory F. Sullivan and Gerald M. Masson and Dwight S. Wilson},
title = {Certification Trails for Data Structures},
booktitle = {Digest of the 1991 Fault Tolerant Computing Symposium},
year = {1991},
pages = {240--247},
publisher = {IEEE Computer Society Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Certification trails are a recently introduced and promising approach to faultdetection and fault-tolerance [19]. In this paper, we significantly generalize the applicability of the certification trail technique. Previously, certification trails had to be customized to each algorithm application, but here we develop trails appropriate to wide classes of algorithms. These certification trails are based on common data-structure operations such as those carried out using balanced binary trees and heaps. Any algorithm using these sets of operations can therefore employ the certification trail method to achieve software fault tolerance. To exemplify the scope of the generalization of the certification trail technique provided in this paper, constructions of trails for abstract data types such as priority queues and union-find structures will be given. These trails are applicable to any data-structure implementation of the abstract data type. It will also be shown that these ideas lead natur...
