Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and Its Applications 2009
DOI: 10.1145/1637837.1637858
|View full text |Cite
|
Sign up to set email alerts
|

Formal validation of deadlock prevention in networks-on-chips

Abstract: Complex systems-on-chips (SoCs) are built as the assembly of pre-designed parameterized components. The specification and validation of the communication infrastructure becomes a crucial step in the early phase of any SoC design. The Generic Network-on-Chip model (GeNoC) has been recently proposed as a generic specification environment, restricted to safety properties. We report on an initial extension of the GeNoC model with a generic termination condition and a generic property showing the prevention of live… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
2
1
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 17 publications
0
3
0
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%
“…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%
“…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%
“…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%