By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Salaun, G. ; VASY, INRIA Rhone-Alpes, Montbonnot ; Serwe, Wendelin ; Thonnart, Y. ; Vivet, P.

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.

Published in:

Asynchronous Circuits and Systems, 2007. ASYNC 2007. 13th IEEE International Symposium on

Date of Conference:

12-14 March 2007