Verifying an infinite systolic algorithm using third-order equational methods

DOI10.1016/j.jlap.2005.10.006zbMath1101.68056OpenAlexW2165205418MaRDI QIDQ2500698

L. J. Steggles

Publication date: 17 August 2006

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2005.10.006

zbMATH Keywords

higher-order algebrainfinite systolic algorithmthird-order equational techniques

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical problems of computer architecture (68M07)

Related Items (1)

Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms

Uses Software

• ELAN

Cites Work

• Universal algebra in higher types
• An algebraic semantics of higher-order types with subtypes
• A completeness theorem for the expressive power of higher-order algebraic specifications
• A survey of stream processing
• On the power of higher-order algebraic specification methods
• On specifications, theories, and models with higher types
• Higher order data types
• Higher-order equational logic for specification, simulation and testing
• Proving and rewriting
• Correctness of dataflow and systolic algorithms using algebras of streams
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Verifying an infinite systolic algorithm using third-order equational methods