A Formal Approach to the Verification of Networks on Chip

Abstract

DOI to the publisher's website.• The final author version and the galley proof are versions of the publication after peer review.• The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

Easy Formal Specification and Validation of Unbounded Networks-on-Chips Architectures

“…We reuse the specification of the wormhole switching policy used in Borrione et al [2009]. Let S whs be that function.…”

“…The current version of GeNoC [Borrione et al 2009] is restricted to safety properties. The global correctness theorem states that messages reaching a destination will reach the expected destination without modification of their content.…”

“…A major addition of our article is the proof of a starvation freedom theorem, described in Section 6. Starvation-prevention mechanisms are still modeled as a reordering of the resources [Borrione et al 2009]. In Borrione et al [2009] no properties are proven with respect to starvation.…”

“…Starvation-prevention mechanisms are still modeled as a reordering of the resources [Borrione et al 2009]. In Borrione et al [2009] no properties are proven with respect to starvation. A peculiar aspect of our formalization is to prove starvation freedom considering finite executions only.…”

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

“…In this context, Schmaltz and Helmy et al [1,18] proposed a functional formalization of networks. They define a generic function-named GeNoC-representing a network with an arbitrary routing function and switching policy.…”