Local Correction of Helix(k) Lists
IEEE Transactions on Computers
A robust B-tree implementation
ICSE '81 Proceedings of the 5th international conference on Software engineering
Effect of probabilistic error checking procedures and performability of robust objects
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Design of Multi-Invariant Data Structures for Robust Shared Accesses in Multiprocessor Systems
IEEE Transactions on Software Engineering
Goal-Directed Reasoning for Specification-Based Data Structure Repair
IEEE Transactions on Software Engineering
| Hi-index | 14.98 |
Two linked data structures utilizing virtual backpointers, the virtual double-linked list (VDLL) and the B-tree with virtual backpointers (VBT), are described. Four experiments that provide example measurements of the capabilities (behavior under multiple error conditions) and performance (time overhead) of both local concurrent error detection and correction using sample VDLL and VBT instances are described. For these structures, double errors within a fixed-size checking window can be detected in constant time, and single errors detected during forward moves can be corrected in constant time.