Verifying deadlock-freedom of communication fabrics
From MaRDI portal
Publication:3075484
Recommendations
- Automatic generation of inductive invariants from high-level microarchitectural models of communication fabrics
- Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks
- Scaling up livelock verification for network-on-chip routing algorithms
- The pursuit of deadlock freedom
- Deadlock-free channels and locks
Cites work
Cited in
(9)- An Expressive Framework for Verifying Deadlock Freedom
- Verification, Model Checking, and Abstract Interpretation
- Scaling up livelock verification for network-on-chip routing algorithms
- Construction of Deadlock-free Designs of Communication Protocols from Observations
- Automatic generation of inductive invariants from high-level microarchitectural models of communication fabrics
- scientific article; zbMATH DE number 7314999 (Why is no real title available?)
- Formal verification of a deadlock detection algorithm
- A formalisation of \textsc{xMAS}
- Verification of building blocks for asynchronous circuits
This page was built for publication: Verifying deadlock-freedom of communication fabrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3075484)