Synthesizing robust data structures-an introduction

Author

Kant, Krishna ; Ravichandran, A.

Author_Institution

Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA, USA

Volume

39

Issue

2

fYear

1990

fDate

2/1/1990 12:00:00 AM

Firstpage

161

Lastpage

173

Abstract

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

Keywords

data structures; fault tolerant computing; trees (mathematics); B-trees; attributes; axioms; concurrent repair; data elements; databases; disjoint portions; first-order logic; formal approach; robust data structures; synthesis; Circuit faults; Data structures; Databases; Error correction; Fault detection; Fault diagnosis; Fault tolerance; Hardware; Logic; Robustness;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.45202

Filename

45202