ePrints

Correctness of Dataflow and Systolic Algorithms: Case Studies in Higher-Order Algebra

Lookup NU author(s): Dr Jason Steggles

Downloads

Full text is not currently available for this publication.

Abstract

We present two case studies which illustrate the use of higher-order algebra as a formalism for specification and verification of hardware algorithms. In the first case study we specify a systolic algorithm for convolution and formally verify its correctness using higher-order equational logic. The second case study demonstrates the expressive power of higher-order algebraic specifications by presenting a non-constructive specification of the Hamming stream problem. A dataflow algorithm for computing the Hamming stream is then specified and the correctness of this algorithm is verified by semantical methods. Both case studies illustrate aspects of the metatheory of higher-order equational logic.

Publication metadata

Author(s): Meinke K, Steggles LJ

Publication type: Report

Publication status: Published

Series Title: Department of Computing Science Technical Report Series

Year: 1996

Pages: 42

Print publication date: 01/11/1996

Source Publication Date: November 1996

Report Number: 559

Institution: Department of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

URL: http://www.cs.ncl.ac.uk/publications/trs/papers/559.pdf

Share