Formal Verification of CHP Specifications with CADP - Illustration on an Asynchronous Network-on-Chip - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Formal Verification of CHP Specifications with CADP - Illustration on an Asynchronous Network-on-Chip

Abstract

Few formal verification techniques are currently available for asynchronous designs. In this paper, we describe a new approach for the formal verification of asynchronous architectures described in the high-level language CHP, by using model checking techniques provided by the CADP toolbox. Our proposal is based on an automatic translation from CHP into LOTOS, the process algebra used in CADP. A translator has been implemented, which handles full CHP including the specific probe operator. The CADP toolbox capabilities allow the designer to verify properties such as deadlock-freedom or protocol correctness on substantial systems. Our approach has been successfully applied to formally verify two complex designs. In this paper, we illustrate our technique on an asynchronous Network-on-Chip architecture. Its formal verification highlights the need to carefully design systems exhibiting non-deterministic behavior.
Fichier principal
Vignette du fichier
Salaun-Serwe-Thonnart-Vivet-07.pdf (126.9 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00200450 , version 1 (20-12-2007)

Identifiers

  • HAL Id : inria-00200450 , version 1

Cite

Gwen Salaün, Wendelin Serwe, Yvain Thonnart, Pascal Vivet. Formal Verification of CHP Specifications with CADP - Illustration on an Asynchronous Network-on-Chip. Proceedings of the 13th IEEE International Symposium on Asynchronous Circuits and Systems ASYNC 2007, Mar 2007, Berkeley, California, United States. ⟨inria-00200450⟩
277 View
385 Download

Share

Gmail Facebook Twitter LinkedIn More