Using fixed-point semantics to prove retiming lemmas

DOI10.1007/BF01383944zbMath0774.68077WikidataQ124815458 ScholiaQ124815458MaRDI QIDQ685101

Stephen Brookes

Publication date: 30 September 1993

Published in: Formal Methods in System Design (Search for Journal in Brave)

zbMATH Keywords

pipeliningfixed-point semanticsretimingsystematic arrays

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Semantics in the theory of computing (68Q55)

Cites Work

• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using fixed-point semantics to prove retiming lemmas