On the public citation graph
On Necessary and Sufficient Conditions for Deadlock-Free Routing in Wormhole Networks
0 signed · 67 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jpdc.1996.0008openalex-snapshot
A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing
inferredcites →https://doi.org/10.1007/10930755_2openalex-snapshot
Formal Specification and Verification of ARM6
inferredcites →https://doi.org/10.1007/3-540-44798-9_26openalex-snapshot
Formal Verification of the VAMP Floating Point Unit
inferredcites →https://doi.org/10.1007/3-540-45949-9openalex-snapshot
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
inferredcites →https://doi.org/10.1007/3-540-55602-8_217openalex-snapshot
PVS: A prototype verification system
inferredcites →https://doi.org/10.1007/3-540-62573-9_4openalex-snapshot
Efficient adaptive routing in networks of workstations with irregular topology
inferredcites →https://doi.org/10.1007/978-1-4471-1591-5_7openalex-snapshot
Floating Point Verification
inferredcites →https://doi.org/10.1007/978-1-4613-2007-4openalex-snapshot
VLSI Specification, Verification and Synthesis
inferredcites →https://doi.org/10.1007/978-1-4613-2007-4_3openalex-snapshot
HOL: A Proof Generating System for Higher-Order Logic
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_51openalex-snapshot
Mechanical Mathematical Methods for Microprocessor Verification
inferredcites →https://doi.org/10.1007/978-3-540-71067-7_3openalex-snapshot
A Short Presentation of Coq
inferredcites →https://doi.org/10.1007/978-3-642-02658-4_28openalex-snapshot
Centaur Technology Media Unit Verification
inferredcites →https://doi.org/10.1007/978-3-642-14052-5_7openalex-snapshot
A Formal Proof of a Necessary and Sufficient Condition for Deadlock-Free Adaptive Networks
inferredcites →https://doi.org/10.1007/bf00243131openalex-snapshot
An approach to systems verification
inferredcites →https://doi.org/10.1007/s00165-007-0049-0openalex-snapshot
A functional formalization of on chip communications
inferredcites →https://doi.org/10.1007/s10009-006-0204-6openalex-snapshot
Putting it all together – Formal verification of the VAMP
inferredcites →https://doi.org/10.1007/s10817-009-9126-9openalex-snapshot
Operating System Verification
inferredcites →https://doi.org/10.1007/s10817-010-9206-xopenalex-snapshot
Proof Pearl: A Formal Proof of Dally and Seitz’ Necessary and Sufficient Condition for Deadlock-Free Routing in Interconnection Networks
inferredcites →https://doi.org/10.1109/71.219761openalex-snapshot
Deadlock-free adaptive routing in multicomputer networks using virtual channels
inferredcites →https://doi.org/10.1109/71.250114openalex-snapshot
A new theory of deadlock-free adaptive routing in wormhole networks
inferredcites →https://doi.org/10.1109/71.473515openalex-snapshot
A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks
inferredcites →https://doi.org/10.1109/71.707539openalex-snapshot
A general theory for deadlock avoidance in wormhole-routed networks
inferredcites →https://doi.org/10.1109/date.2010.5457089openalex-snapshot
Formal specification of networks-on-chips: deadlock and evacuation
inferredcites →https://doi.org/10.1109/pdp.2010.19openalex-snapshot
A Polynomial Algorithm to Prove Deadlock-Freeness of Wormhole Networks
inferredcites →https://doi.org/10.1109/pdp.2011.23openalex-snapshot
A Fast and Verified Algorithm for Proving Store-and-Forward Networks Deadlock-Free
inferredcites →https://doi.org/10.1109/tc.1987.1676939openalex-snapshot
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
inferredcites →https://doi.org/10.1109/tpds.2011.16openalex-snapshot
A Comment on “A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks”
inferredcites →https://doi.org/10.1112/s1461157000000176openalex-snapshot
A Mechanically Checked Proof of IEEE Compliance of the Floating Point Multiplication, Division and Square Root Algorithms of the AMD-K7™ Processor
inferredcites →https://doi.org/10.1145/140901.140902openalex-snapshot
Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks
inferredcites →https://doi.org/10.1145/165123.165177openalex-snapshot
A comparison of adaptive wormhole routing algorithms
inferredcites →https://doi.org/10.1145/173682.165177openalex-snapshot
A comparison of adaptive wormhole routing algorithms
inferredcites →https://doi.org/10.1145/185675.185682openalex-snapshot
The turn model for adaptive routing
inferredcites →https://doi.org/10.1155/2009/548324openalex-snapshot
A Formal Approach to the Verification of Networks on Chip
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.6055openalex-snapshot
A high‐performance FPGA‐based multicrossbar prioritized network‐on‐chip
inferred← citeshttps://doi.org/10.1007/978-3-319-27119-4_33openalex-snapshot
A General Methodology to Design Deadlock-Free Routing Algorithms for Mesh Networks
inferred← citeshttps://doi.org/10.1007/s11227-015-1428-6openalex-snapshot
Balancing virtual channel utilization for deadlock-free routing in torus networks
inferred← citeshttps://doi.org/10.1007/s11227-015-1597-3openalex-snapshot
Conditional forwarding: simple flow control to increase adaptivity for fully adaptive routing algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-12-800979-6.00006-8openalex-snapshot
Flow control for fully adaptive routing††Part of this research was first presented at the 18th IEEE International Symposium on High Performance Computer Architecture (HPCA-2012) [32]. The journal extension edition of the HPCA-2012 paper was published in IEEE Transactions on Parallel and…
inferred← citeshttps://doi.org/10.1016/j.scico.2016.01.002openalex-snapshot
An improved fault-tolerant routing algorithm for a Network-on-Chip derived with formal analysis
inferred← citeshttps://doi.org/10.1109/dft.2016.7684082openalex-snapshot
A new approach to deadlock-free fully adaptive routing for high-performance fault-tolerant NoCs
inferred← citeshttps://doi.org/10.1109/ets.2017.7968219openalex-snapshot
Rout3D: A lightweight adaptive routing algorithm for tolerating faulty vertical links in 3D-NoCs
inferred← citeshttps://doi.org/10.1109/hpca.2012.6169049openalex-snapshot
Whole packet forwarding: Efficient design of fully adaptive routing algorithms for networks-on-chip
inferred← citeshttps://doi.org/10.1109/hpcc.and.euc.2013.193openalex-snapshot
VCBR: Virtual Channel Balanced Routing in Torus Networks
inferred← citeshttps://doi.org/10.1109/mcsoc60832.2023.00056openalex-snapshot
Systematic Construction of Deadlock-Free Routing for NoC Using Integer Linear Programming
inferred← citeshttps://doi.org/10.1109/pdp.2011.23openalex-snapshot
A Fast and Verified Algorithm for Proving Store-and-Forward Networks Deadlock-Free
inferred← citeshttps://doi.org/10.1109/pdp.2014.12openalex-snapshot
The Multi-level Communication: Minimal Deadlock-Free and Storage Efficient Routing for Torus Networks
inferred← citeshttps://doi.org/10.1109/pdp.2016.69openalex-snapshot
MWPF: A Deadlock Avoidance Fully Adaptive Routing Algorithm in Networks-on-Chip
inferred← citeshttps://doi.org/10.1109/tc.2016.2584060openalex-snapshot
Deadlock Verification of Cache Coherence Protocols and Communication Fabrics
inferred← citeshttps://doi.org/10.1109/tc.2017.2786723openalex-snapshot
A Compositional Approach for Verifying Protocols Running on On-Chip Networks
inferred← citeshttps://doi.org/10.1109/tc.2024.3365954openalex-snapshot
Efficient Deadlock Avoidance for 2-D Mesh NoCs That Use OQ or VOQ Routers
inferred← citeshttps://doi.org/10.1109/tetc.2017.2776909openalex-snapshot
A Dynamic Sufficient Condition of Deadlock-Freedom for High-Performance Fault-Tolerant Routing in Networks-on-Chips
inferred← citeshttps://doi.org/10.1109/tpds.2011.16openalex-snapshot
A Comment on “A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks”
inferred← citeshttps://doi.org/10.1109/tpds.2013.121openalex-snapshot
A Decision Procedure for Deadlock-Free Routing in Wormhole Networks
inferred← citeshttps://doi.org/10.1109/tpds.2013.166openalex-snapshot
Novel Flow Control for Fully Adaptive Routing in Cache-Coherent NoCs
inferred← citeshttps://doi.org/10.1145/1999946.1999951openalex-snapshot
Automatic verification for deadlock in Networks-on-Chips with adaptive routing and wormhole switching
inferred← citeshttps://doi.org/10.1145/2071356.2071357openalex-snapshot
Easy Formal Specification and Validation of Unbounded Networks-on-Chips Architectures
inferred← citeshttps://doi.org/10.23919/date54114.2022.9774519openalex-snapshot
Full-credit Flow Control: A Novel Technique to Implement Deadlock-free Adaptive Routing
inferred← citeshttps://doi.org/10.4204/eptcs.70openalex-snapshot
Formal verification of a deadlock detection algorithm
inferred← citeshttps://doi.org/10.4204/eptcs.70.8openalex-snapshot
Formal verification of a deadlock detection algorithm
inferred← citeshttps://doi.org/10.70675/dc5949aezb853z4e28z97e0za9e799c15044openalex-snapshot
Adaptive NoC for reconfigurable SoC
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.