Formal validation of deadlock prevention in networks-on-chips

Verbeek, Freek; Schmaltz, Julien

doi:10.1145/1637837.1637858

Cited by 4 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Equivalence theorem obtain a general verification method. We also are working on extending GeNoC-L2 to support global and applicationindependent properties like functional correctness or deadlock avoidance [15]. We are convinced that the structure of our implementation is similar to the actual structure of RTL designs.…”

Section: Discussionmentioning

confidence: 93%

Towards a formally verified network-on-chip

Broek

Schmaltz

2009

2009 Formal Methods in Computer-Aided Design

Self Cite

View full text Add to dashboard Cite

Multi-Processor Systems-on-Chip (MPSoC) designs are constructed by assembling pre-designed parameterized components. Communications are crucial to their overall functionality and performance. Formal verification methods have been intensively applied to processing elements, e.g., microprocessors. Very little work has been done with respect to communication modules. We present the formal specification of a packet switched NoC and its proven refinement. At the specification level, routing decisions are computed at once before packets get injected in the network. In the implementation, routing decisions are distributed over each individual node. We prove that the implementation behaves according to its specification for a 2D-mesh NoC. All models and proofs have been checked using the ACL2 theorem proving system. To the best of our knowledge, this work constitutes the first cross-layer verification of on-chip communication networks.

show abstract

Section: Discussionmentioning

confidence: 93%

Towards a formally verified network-on-chip

Broek

Schmaltz

2009

2009 Formal Methods in Computer-Aided Design

Self Cite

View full text Add to dashboard Cite

show abstract

“…In combination with work on the analysis of livelock [20] we were able to prove theorems like all injected messages eventually reach their destination and leave the network for a specification of a Network-on-Chip [21].…”

Section: Applicationsmentioning

confidence: 99%

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

Verbeek

Schmaltz

2010

J Autom Reasoning

Self Cite

View full text Add to dashboard Cite

Avoiding deadlock is crucial to interconnection networks. In '87, Dally and Seitz proposed a necessary and sufficient condition for deadlock-free routing. This condition states that a routing function is deadlock-free if and only if its channel dependency graph is acyclic. We formally define and prove a slightly different condition from which the original condition of Dally and Seitz can be derived. Dally and Seitz prove that a deadlock situation induces cyclic dependencies by reductio ad absurdum. In contrast we introduce the notion of a waiting graph from which we explicitly construct a cyclic dependency from a deadlock situation. Moreover, our proof is structured in such a way that it only depends on a small set of proof obligations associated to arbitrary routing functions and switching policies. Discharging these proof obligations is sufficient to instantiate our condition for deadlock-free routing on particular networks. Our condition and its proof have been formalized using the ACL2 theorem proving system.

show abstract

“…Duato [8] was the first one to propose necessary and sufficient conditions for deadlock-free routing in packet switching. In the context of NoCs, Verbeek [13][14][15] formulated a necessary and sufficient condition for deadlock-free routing that is equivalent to that of Duato. The notion of local deadlock we introduce in Section 3.2 is equivalent to those of Duato and Verbeek.…”

Section: Introductionmentioning

confidence: 99%

Deadlock in packet switching networks

Stramaglia¹,

Keiren²,

Zantema³

2021

Preprint

View full text Add to dashboard Cite

A deadlock in a packet switching network is a state in which one or more messages have not yet reached their target, yet cannot progress any further. We formalize three different notions of deadlock in the context of packet switching networks, to which we refer as global, local and weak deadlock. We establish the precise relations between these notions, and prove they characterize different sets of deadlocks. Moreover, we implement checking of deadlock freedom of packet switching networks using the symbolic model checker nuXmv. We show experimentally that the implementation is effective at finding subtle deadlock situations in packet switching networks.

show abstract

Formal validation of deadlock prevention in networks-on-chips

Cited by 4 publications

References 17 publications

Towards a formally verified network-on-chip

Towards a formally verified network-on-chip

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

Deadlock in packet switching networks

Contact Info

Product

Resources

About