Functional Term Rewriting Systems towards Symbolic Model-Checking

Abstract : This paper proposes the theoretical foundations of a new formal tool for symbolic verification of finite systems. 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. Second, we present the implementation of our FTRS-based tool as well as optimizations based on local fixpoint computations. Our experiments show that for well-known protocols (e.g. Tree Arbiter, Percolate, Leader Election Protocol,...) our tool is more efficient than other rewriting tools such as Timbuk, Maude or Tom. Moreover, it can also be applied to check invariant properties which are a particular subclass of linear temporal logic formula (LTL).
Document type :
Journal articles
Complete list of metadatas
Contributor : Yohan Boichut <>
Submitted on : Tuesday, May 10, 2011 - 4:42:31 PM
Last modification on : Thursday, February 7, 2019 - 3:55:19 PM


  • HAL Id : hal-00591994, version 1



Yohan Boichut, Jean-Michel Couvreur, Duy Tung Nguyen. Functional Term Rewriting Systems towards Symbolic Model-Checking. International Journal of Critical Computer-Based Systems, Inderscience, 2011. ⟨hal-00591994⟩



Record views