Abstract Regular Tree Model Checking - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Theoretical Computer Science Année : 2006

Abstract Regular Tree Model Checking

Résumé

Regular (tree) model checking (RMC) is a promising generic method for formal verification of infinite-state systems. It encodes configurations of systems as words or trees over a suitable alphabet, possibly infinite sets of configurations as finite word or tree automata, and operations of the systems being examined as finite word or tree transducers. The reachability set is then computed by a repeated application of the transducers on the automata representing the currently known set of reachable configurations. In order to facilitate termination of RMC, various acceleration schemas have been proposed. One of them is a combination of RMC with the abstract-check-refine paradigm yielding the so-called abstract regular model checking (ARMC). ARMC has originally been proposed for word automata and transducers only and thus for dealing with systems with linear (or easily linearisable) structure. In this paper, we propose a generalisation of ARMC to the case of dealing with trees which arise naturally in a lot of modelling and verification contexts. In particular, we first propose abstractions of tree automata based on collapsing their states having an equal language of trees up to some bounded height. Then, we propose an abstraction based on collapsing states having a non-empty intersection (and thus "satisfying") the same bottom-up tree "predicate" languages. Finally, we show on several examples that the methods we propose give us very encouraging verification results.
Fichier principal
Vignette du fichier
BHRV-infinity05.pdf (123.47 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00156828 , version 1 (22-06-2007)

Identifiants

  • HAL Id : hal-00156828 , version 1

Citer

Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomas Vojnar. Abstract Regular Tree Model Checking. Electronic Notes in Theoretical Computer Science, 2006, 149 (1), pp.37-48. ⟨hal-00156828⟩
116 Consultations
154 Téléchargements

Partager

Gmail Facebook X LinkedIn More