Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae

Abstract

A factor in the complexity of conventional algorithms for model checking Computation Tree Logic (CTL) is the size of the formulae, and, more precisely, the number of fixpoint operators. This paper addresses the following questions: given a CTL formula, is there an equivalent formula with fewer fixpoint operators? and how term rewriting techniques may be used to find it? Moreover, for some sublogics of CTL, e.g. the sub-logic NFCTL (no fixpoint computation tree logic), more efficient verification procedures are available. This paper also addresses the problem of testing whether an expression belongs or not to NFCTL, and providing support in the choice of the most efficient amongst different available verification algorithms. In this direction, we propose a rewrite system modulo AC, and discuss its implementation in ELAN, showing how this rewriting process can be plugged in a formal verification tool.

Domains

Other [cs.OH]
Not file

Dates and versions

inria-00100863 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00100863 , version 1

Cite

David Déharbe, Anamaria Martins Moreira, Christophe Ringeissen. Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae. International Conference on Rewriting Techniques and Applications - RTA'2002, Thomas Arts, Jul 2002, Copenhagen, Denmark, pp.207-221. ⟨inria-00100863⟩
53 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More