Notions of Knowledge in Combinations of Theories Sharing Constructors

Abstract : One of the most effective methods developed for the analysis of security protocols is an approach based on equational reasoning and unification. In this approach, it is important to have the capability to reason about the knowledge of an intruder. Two important measures of this knowledge, defined modulo equational theories, are deducibility and static equivalence. We present new combination techniques for the study of deducibility and static equivalence in unions of equational theories sharing constructors. Thanks to these techniques, we obtain new modularity results for the decidability of deducibility and static equivalence. In turn, this should allow for the analysis of protocols involving combined equational theories which previous disjoint combination methods could not address due to their non-disjoint axiomatization.
Type de document :
Communication dans un congrès
Leonardo de Moura. 26th International Conference on Automated Deduction, Aug 2017, Göteborg, Sweden. Springer, 10395, pp.60 - 76, 2017, Lecture Notes in Artificial Intelligence. 〈10.1007/978-3-319-63046-5_5〉
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01587181
Contributeur : Christophe Ringeissen <>
Soumis le : mercredi 13 septembre 2017 - 17:43:20
Dernière modification le : jeudi 14 septembre 2017 - 01:09:13

Fichier

combi-know.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Serdar Erbatur, Andrew Marshall, Christophe Ringeissen. Notions of Knowledge in Combinations of Theories Sharing Constructors. Leonardo de Moura. 26th International Conference on Automated Deduction, Aug 2017, Göteborg, Sweden. Springer, 10395, pp.60 - 76, 2017, Lecture Notes in Artificial Intelligence. 〈10.1007/978-3-319-63046-5_5〉. 〈hal-01587181〉

Partager

Métriques

Consultations de la notice

83

Téléchargements de fichiers

7