Implementing a Unification Algorithm for Protocol Analysis with XOR

Max Tuengerthal 1 Ralf Küsters 1 Mathieu Turuani 2
2 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 : In this paper, we propose a unification algorithm for the theory $E$ which combines unification algorithms for $E_{\std}$ and $E_{\ACUN}$ (ACUN properties, like XOR) but compared to the more general combination methods uses specific properties of the equational theories for further optimizations. Our optimizations drastically reduce the number of non-deterministic choices, in particular those for variable identification and linear orderings. This is important for reducing both the runtime of the unification algorithm and the number of unifiers in the complete set of unifiers. We emphasize that obtaining a ``small'' set of unifiers is essential for the efficiency of the constraint solving procedure within which the unification algorithm is used. The method is implemented in the CL-Atse tool for security protocol analysis.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/inria-00103602
Contributor : Mathieu Turuani <>
Submitted on : Wednesday, October 4, 2006 - 5:35:00 PM
Last modification on : Friday, July 6, 2018 - 3:06:09 PM
Long-term archiving on : Tuesday, April 6, 2010 - 6:15:09 PM

Identifiers

  • HAL Id : inria-00103602, version 1
  • ARXIV : cs/0610014

Citation

Max Tuengerthal, Ralf Küsters, Mathieu Turuani. Implementing a Unification Algorithm for Protocol Analysis with XOR. 20th International Workshop on Unification - UNIF'06, Aug 2006, Seattle, WA/USA, pp.1-5. ⟨inria-00103602⟩

Share

Metrics

Record views

206

Files downloads

213