ePrints

Verifying an Infinite Systolic Algorithm using Third-Order Algebraic Methods

Lookup NU author(s): Dr Jason Steggles

Downloads

• Published version [.pdf]

Abstract

We consider using third--order algebraic methods to specify and equationally verify an infinite systolic algorithm for convolution. The detailed case study we present provides an interesting insight into the use of third--order algebra as a formal framework for developing families of computing systems. We consider using purely equational reasoning in our verification proofs and in particular, using the rule of free variable induction. We conclude by considering how our verification proofs can be automated using rewriting techniques.

Publication metadata

Author(s): Steggles LJ

Publication type: Report

Publication status: Published

Series Title: School of Computing Science Technical Report Series

Year: 2003

Pages: 15

Print publication date: 01/01/2003

Source Publication Date: 2003

Report Number: 795

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

Place Published: Newcastle upon Tyne

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

Share