Automatic verification of a class of systolic circuits
From MaRDI portal
Publication:1189257
DOI10.1007/BF01212335zbMath0764.68093OpenAlexW2031444332MaRDI QIDQ1189257
Publication date: 26 September 1992
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01212335
Circuits, networks (94C99) Specification and verification (program logics, model checking, etc.) (68Q60) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reasoning about networks with many identical finite state processes
- Mechanical certification of systolic algorithms
- A Mathematical Model for the Verification of Systolic Networks
- Proving systolic systems correct
- Systolic arrays for Viterbi processing in communication systems with a time-dispersive channel
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Hilbert's Tenth Problem is Unsolvable