Proof Pearl: A Formal Proof of Dally and Seitz' Necessary and Sufficient Condition for Deadlock-Free Routing in Interconnection Networks

Thumbnail
Fulltext:
84151.pdf
Embargo:
until further notice
Size:
376.0Kb
Format:
PDF
Description:
Publisher’s version
Publication year
2012
Author(s)
Verbeek, F.
Schmaltz, J.
Source
Journal of Automated Reasoning, 48, 4, (2012), pp. 419-439
ISSN
DOI
Publication type
Article / Letter to editor
If a DOI or any other persistent identifier is unavailable, please use the following repository identifier to link to this item: https://hdl.handle.net/2066/84151   https://hdl.handle.net/2066/84151
Display more details

Upload full text

Use your RU credentials (u/z-number and password) to log in with SURFconext to upload a file for processing by the repository team.