By Topic

Experimental evaluation of certification trails using abstract data type validation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wilson, D.S. ; Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA ; Sullivan, G.F. ; Masson, G.M.

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

Published in:

Computer Software and Applications Conference, 1992. COMPSAC '92. Proceedings., Sixteenth Annual International

Date of Conference:

21-25 Sep 1992