Skip to Main content Skip to Navigation
New interface

Vérification symbolique de modèles à l'aide de systèmes de ré-écriture dédiés

Abstract : This PhD thesis proposes the theoretical foundations of a new formal tool for symbolic verification of finite models. Some approaches reduce the problem of system verification to the reachability problem in term rewriting systems (TRSs).In our approach, states are encoded by terms in a BDD-like manner and the transition relation is represented by a new rewriting relation so called Functional Term Rewriting Systems (FTRSs).First, we show that FTRSs are as expressive as TRSs. Then, we focus on a subclass of FTRSs, so called Elementary Functional Term Rewriting Systems (EFTRSs), and we show that EFTRSs preserve the FTRSs expressiveness. The main advantage of EFTRSs is that they are well adapted for acceleration techniques usually used in saturation algorithms on BDD-like data structures.Our experiments show that for well-known protocols (e.g. Tree Arbiter, Percolate, Round RobinMutex protocols,... ) our tool is not only better than other rewriting tools such as Timbuk, Maude or TOM, but also competitive with other model-checkers such as SPIN, NuSMV or SMART. Moreover, it can also be applied to model-checking invariant properties which are a particular subclass of linear temporal logic formula (LTL).
Document type :
Complete list of metadata

Cited literature [68 references]  Display  Hide  Download
Contributor : ABES STAR :  Contact
Submitted on : Tuesday, April 12, 2011 - 5:06:17 PM
Last modification on : Thursday, October 20, 2022 - 3:51:43 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00579490, version 2


Duy-Tùng Nguyên. Vérification symbolique de modèles à l'aide de systèmes de ré-écriture dédiés. Ordinateur et société [cs.CY]. Université d'Orléans, 2010. Français. ⟨NNT : 2010ORLE2030⟩. ⟨tel-00579490v2⟩



Record views


Files downloads