Theorem proving techniques for the formal verification of NoC communications with non-minimal adaptive routing
Authors:
- 1 April 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 221-224
Abstract
This paper focuses on the formal verification of communications in Networks on Chip. We describe how an enhanced version of the GeNoC proof methodology has been applied to the Nostrum NoC which encompasses various non-trivial features such as a deflective non-minimal routing algorithm. We demonstrate how the features of the Nostrum protocol layers can be captured by the current version of GeNoC that enables a step-by-step formalization of communication operations while taking various protocol details into consideration. We prove that packets arrive properly and that packets are never lost. Also, we prove the soundness of the Nostrum data link, network and transport layers.Keywords
This publication has 9 references indexed in Scilit:
- 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
- Transaction-Based Communication-Centric Debug2007
- A Generic Model for Formally Verifying NoC Communication Architectures: A Case Study2007
- Models of Computation for Networks on Chip2006
- MAIA - a framework for networks on chip generation and verification2005
- A Design Flow for Application-Specific Networks on Chip with Guaranteed Performance to Accelerate SOC Design and Verification2005
- The Nostrum backbone-a communication protocol stack for Networks on Chip2004
- Load distribution with the proximity congestion awareness in a network on chip2003