login

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

Proceedings of the International Symposium on Advanced Research in Asynchronous Circuits and SystemsPublished 1 March 2007
Gwen Salaün, Wendelin Serwe, Yvain Thonnart, Pascal Vivet
Citations31

TL;DR

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 is described, based on an automatic translation from CHP into LOTOS, the process algebra used in CADP.

Abstract

Few formal verification techniques are currently avail-able 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 ver-ify properties such as deadlock-freedom or protocol correct-ness on substantial systems. Our approach has been suc-cessfully applied to formally verify two complex designs. In this paper, we illustrate our technique on an asynchronous Network-on-Chip architecture. Its formal verification high-lights the need to carefully design systems exhibiting non-deterministic behavior. 1.

Keywords

Computer ScienceEngineering