A Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations

Abstract : In computer aided verification, the reachability problem is particularly relevant for safety analyses. Given a regular tree language L, a term t and a relation R, the reachability problem consists in deciding whether a sequence of terms, beginning with a term of L and terminating on t and such that two successive terms of this sequence are in relation according to R, is constructable. In this case, the term t is said to be reachable, otherwise it is said unreachable. This problem is decidable for particular kinds of relations, but it is known to be undecidable in general, even if L is finite. Several approaches to tackle the unreachability problem are based on the computation of an R-closed regular language containing L. In this paper we show a theoretical limit to this kind of approaches for this problem.
Type de document :
[Research Report] RR-6411, INRIA. 2008, pp.6
Liste complète des métadonnées

Littérature citée [2 références]  Voir  Masquer  Télécharger

Contributeur : Rapport de Recherche Inria <>
Soumis le : mardi 15 janvier 2008 - 12:57:13
Dernière modification le : vendredi 6 juillet 2018 - 15:06:05
Document(s) archivé(s) le : mardi 21 septembre 2010 - 15:58:03


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00204579, version 2


Yohan Boichut, Pierre-Cyrille Heam. A Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations. [Research Report] RR-6411, INRIA. 2008, pp.6. 〈inria-00204579v2〉



Consultations de la notice


Téléchargements de fichiers