The authors report on an attempt to assess the performance of algorithms utilizing certification trails on abstract data types. Specifically, they have applied this method to the following problems: heapsort, Huffman 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. >
['Dwight S. Wilson', 'G. Sullivan', 'Gerald M. Masson']
Experimental evaluation of certification trails using abstract data type validation