A theory of diagnosis from first principles
Artificial Intelligence
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
FINE: A Fault Injection and Monitoring Environment for Tracing the UNIX System Behavior Under Faults
IEEE Transactions on Software Engineering - Special issue on software reliability
IEEE Transactions on Knowledge and Data Engineering
Method for designing and placing check sets based on control flow analysis of programs
ISSRE '96 Proceedings of the The Seventh International Symposium on Software Reliability Engineering
Checking the Integrity of Trees
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
On-Line Error Monitoring for Several Data Structures
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Samurai: protecting critical data in unsafe languages
Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008
| Hi-index | 14.98 |
A formal approach is presented for the analysis and synthesis of robust data structures. The entire data structure is viewed as a collection of data elements related via some attributes. The relationships are specified by a set of axioms in first-order logic. Faults in attributes invalidate some of the axioms. The invalidated axioms are used to detect and correct the faulty attributes. The authors show how detection and correction can be localized to small portions of the data structure, thereby allowing concurrent repair in several disjoint portions. This property makes local correction attractive for B-trees and other structures used in databases. They then show how the ideas developed for attaining structural integrity can be applied to achieve data integrity as well.