Tree automata with equality constraints modulo equational theories - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Tree automata with equality constraints modulo equational theories

Résumé

This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that this class has a good potential for application in e.g. software verification. These tree automata are obtained by extending the standard Horn clause representations with equational conditions and rewrite systems. We show in particular that a generalized membership problem (extending the emptiness problem) is decidable by proving that the saturation of tree automata presentations with suitable paramodu- lation strategies terminates. Alternatively our results can be viewed as new decidable classes of first-order formula.
Fichier principal
Vignette du fichier
rr-lsv-2006-07.pdf (473.11 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00579011 , version 1 (22-03-2011)

Identifiants

Citer

Florent Jacquemard, Michael Rusinowitch, Laurent Vigneron. Tree automata with equality constraints modulo equational theories. 3d International Joint Conference on Automated Reasoning (IJCAR), Aug 2006, Seattle, United States. pp.557-571, ⟨10.1007/11814771_45⟩. ⟨inria-00579011⟩
159 Consultations
189 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More