Issue No. 02 - February (1990 vol. 39)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.45202
<p>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.</p>
formal approach; synthesis; robust data structures; data elements; attributes; first-order logic; axioms; concurrent repair; disjoint portions; B-trees; databases; data structures; fault tolerant computing; trees (mathematics).
A. Ravichandran, K. Kant, "Synthesizing Robust Data Structures-An Introduction", IEEE Transactions on Computers, vol. 39, no. , pp. 161-173, February 1990, doi:10.1109/12.45202