Knowledge Problems in Equational Extensions of Subterm Convergent Theories - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Knowledge Problems in Equational Extensions of Subterm Convergent Theories

Résumé

We study decision procedures for two knowledge problems critical to the verification of security protocols, namely the intruder deduction and the static equivalence problems. These problems can be related to particular forms of context matching and context unification. Both problems are defined with respect to an equational theory and are known to be decidable when the equational theory is given by a subterm convergent term rewrite system. In this note we extend this to consider a subterm convergent equational term rewrite system defined modulo an equational theory, like Commutativity or Associativity-Commutativity. We show that for certain classes of such equational theories, namely the shallow classes, the two knowledge problems remain decidable.
Fichier principal
Vignette du fichier
subterm-know.pdf (276.11 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01878567 , version 1 (21-09-2018)

Identifiants

  • HAL Id : hal-01878567 , version 1

Citer

Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen. Knowledge Problems in Equational Extensions of Subterm Convergent Theories. UNIF 2018 - 32nd International Workshop on Unification, Mauricio Ayala-Rincon; Philippe Balbiani, Jul 2018, Oxford, United Kingdom. ⟨hal-01878567⟩
71 Consultations
42 Téléchargements

Partager

Gmail Facebook X LinkedIn More