Using fixed-point semantics to prove retiming lemmas
From MaRDI portal
Publication:685101
DOI10.1007/BF01383944zbMath0774.68077WikidataQ124815458 ScholiaQ124815458MaRDI QIDQ685101
Publication date: 30 September 1993
Published in: Formal Methods in System Design (Search for Journal in Brave)
Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Semantics in the theory of computing (68Q55)
Cites Work
This page was built for publication: Using fixed-point semantics to prove retiming lemmas