Unification modulo Chaining - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Unification modulo Chaining

Résumé

We model chaining in terms of a simple, convergent, rewrite system over a signature with two disjoint sorts: list and element. By interpreting a particular symbol of this signature suitably, the rewrite system can model several practical situations of interest. An inference procedure is presented for deciding the unification problem modulo this rewrite system. The procedure is modular in the following sense: any given problem is handled by a system of 'list-inferences', and the set of equations thus derived between the element-terms of the problem is then handed over to any ('black-box') procedure which is complete for solving these element-equations. An example of application of this unification procedure is given, as attack detection on a Needham-Schroeder like protocol employing the CBC encryption mode.
Fichier non déposé

Dates et versions

hal-00659027 , version 1 (11-01-2012)

Identifiants

  • HAL Id : hal-00659027 , version 1

Citer

Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michaël Rusinowitch. Unification modulo Chaining. The 6th International Conference on Language and Automata Theory and Applications, Mar 2012, A Coruna, Spain. pp. 70--82. ⟨hal-00659027⟩
153 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More