#### Filter Results:

#### Publication Year

2011

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine A. Meadows +4 others
- CADE
- 2013

We present a new paradigm for unification arising out of a technique commonly used in cryptographic protocol analysis tools that employ unification modulo equational theories. This paradigm relies on: (i) a decomposition of an equational theory into (R, E) where R is conflu-ent, terminating, and coherent modulo E, and (ii) on reducing unification problems… (More)

We address a problem that arises in cryptographic protocol analysis when the equational properties of the cryptosystem are taken into account: in many situations it is necessary to guarantee that certain terms generated during a state exploration are in normal form with respect to the equational theory. We give a tool-independent methodology for state… (More)

A full version of this work [5] appeared in the proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures (FoS-SaCS 2014). In the following, we provide a summary of this work.

We discuss the use of type systems in a non-strict sense when designing unification algorithms. We first give a new (rule-based) algorithm for an equational theory which represents a property of El-Gamal signature schemes and show how a type system can be used to prove termination of the algorithm. Lastly, we reproduce a termination result for theory of… (More)

- ‹
- 1
- ›