Proof Pearl: A Formal Proof of Dally and Seitz’ Necessary and Sufficient Condition for Deadlock-Free Routing in Interconnection Networks
- 18 September 2010
- journal article
- research article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 48 (4) , 419-439
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Formal specification of networks-on-chips: deadlock and evacuation2010
- A Formal Approach to the Verification of Networks on ChipEURASIP Journal on Embedded Systems, 2009
- A functional formalization of on chip communicationsFormal Aspects of Computing, 2008
- Quantification in tail-recursive function definitions2006
- Partial Functions in ACL2Journal of Automated Reasoning, 2003
- A general theory for deadlock avoidance in wormhole-routed networksIEEE Transactions on Parallel and Distributed Systems, 1998
- An industrial strength theorem prover for a logic based on Common LispIEEE Transactions on Software Engineering, 1997
- A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networksIEEE Transactions on Parallel and Distributed Systems, 1995
- A universal proof technique for deadlock-free routing in interconnection networks1995
- The addition of bounded quantification and partial functions to a computational logic and its theorem proverJournal of Automated Reasoning, 1988