Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks (Q437040)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks |
scientific article; zbMATH DE number 6057742
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks |
scientific article; zbMATH DE number 6057742 |
Statements
Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks (English)
0 references
17 July 2012
0 references
deadlock-free routing
0 references
interactive theorem proving
0 references
ACL2
0 references
0 references
0.8713434934616089
0 references
0.7985174655914307
0 references
0.7899463176727295
0 references
0.7460037469863892
0 references
0.7434320449829102
0 references
