Knowledge Problems in Equational Extensions of Subterm Convergent Theories - Archive ouverte HAL Access content directly
Conference Papers Year :

Knowledge Problems in Equational Extensions of Subterm Convergent Theories

(1) , (2) , (3)
1
2
3

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : hal-01878567 , version 1

Cite

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⟩
66 View
35 Download

Share

Gmail Facebook Twitter LinkedIn More