Unification modulo Chaining

Siva Anantharaman 1 Christopher Bouchard 2 Paliath Narendran 2 Michaël Rusinowitch 3
3 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00659027
Contributor : Siva Anantharaman <>
Submitted on : Wednesday, January 11, 2012 - 7:47:21 PM
Last modification on : Thursday, June 27, 2019 - 1:24:47 AM

Identifiers

  • HAL Id : hal-00659027, version 1

Citation

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⟩

Share

Metrics

Record views

339