Verifying an infinite systolic algorithm using third-order equational methods
From MaRDI portal
Publication:2500698
Recommendations
Cites work
- scientific article; zbMATH DE number 4016180 (Why is no real title available?)
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 3919789 (Why is no real title available?)
- scientific article; zbMATH DE number 4078770 (Why is no real title available?)
- scientific article; zbMATH DE number 50758 (Why is no real title available?)
- scientific article; zbMATH DE number 1088024 (Why is no real title available?)
- scientific article; zbMATH DE number 1543358 (Why is no real title available?)
- A completeness theorem for the expressive power of higher-order algebraic specifications
- A survey of stream processing
- An algebraic semantics of higher-order types with subtypes
- Correctness of dataflow and systolic algorithms using algebras of streams
- Higher order data types
- Higher-order equational logic for specification, simulation and testing
- On specifications, theories, and models with higher types
- On the power of higher-order algebraic specification methods
- Proving and rewriting
- Specification of abstract data types
- Universal algebra in higher types
Cited in
(3)- Correctness of dataflow and systolic algorithms using algebras of streams
- Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers
- Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms
This page was built for publication: Verifying an infinite systolic algorithm using third-order equational methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500698)