Experimental evaluation of certification trails using abstract data type validation

Abstract

Verbatim from NASA NTRS. Not paraphrased, not summarized.

Certification trails are a recently introduced and promising approach to fault-detection and fault-tolerance. Recent experimental work reveals many cases in which a certification-trail approach allows for significantly faster program execution time than a basic time-redundancy approach. Algorithms for answer-validation of abstract data types allow a certification trail approach to be used for a wide variety of problems. An attempt to assess the performance of algorithms utilizing certification trails on abstract data types is reported. Specifically, this method was applied to the following problems: heapsort, Hullman tree, shortest path, and skyline. Previous results used certification trails specific to a particular problem and implementation. The approach allows certification trails to be localized to 'data structure modules,' making the use of this technique transparent to the user of such modules.

Authors

• Wilson, Dwight S. Johns Hopkins Univ.
• Sullivan, Gregory F. Johns Hopkins Univ.
• Masson, Gerald M. Johns Hopkins Univ.