Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
| Hi-index | 0.00 |
A result checker is a program that checks the outputof the computation of the observed program for correctness. Introduced originally by Blum, the result checkingparadigm has provided a powerful platform assuring thereliability of software. However, constructing result checkers for most problems requires not only significant domain knowledge but also ingenuity and can be error prone. Inthis paper we present our experience in validating resultcheckers using formal methods. We have conducted severalcase studies in validating result checkers from the commercial LEDA system for combinatorial and geometric computing. In one of our case studies, we detected a logical errorin a result checker for a program computing max flow of a graph.