HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download

Contributor : Wendelin Serwe Connect in order to contact the contributor
Submitted on : Thursday, December 20, 2007 - 8:10:57 PM
Last modification on : Friday, February 4, 2022 - 3:29:41 AM
Long-term archiving on: : Monday, April 12, 2010 - 8:43:45 AM


Files produced by the author(s)


  • HAL Id : inria-00200450, version 1



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⟩



Record views


Files downloads