(1) Department of Computer Science, The Pennsylvania State University, 16802 University Park, PA, U.S.A.;(2) AT & T Bell Labs, 07733 Holmdel, NJ, U.S.A.
Abstract:
We present in this paper an approach for mechanically certifying the correctness of systolic algorithms and detail the correctness proof of a systolic algorithm for a dynamic programming (optimal parenthesization) problem.