Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
On equational theories, unification, and (Un)decidability
Journal of Symbolic Computation
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Using CSP to Detect Errors in the TMN Protocol
IEEE Transactions on Software Engineering
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Remarks on Generalized Post Correspondence Problem
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Key Distribution Protocol for Digital Mobile Communication Systems
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A Maude coherence checker tool for conditional order-sorted rewrite theories
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Efficient general unification for XOR with homomorphism
CADE'11 Proceedings of the 23rd international conference on Automated deduction
The finite variant property: how to get rid of some algebraic properties
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Automated Analysis of Diffie-Hellman Protocols and Advanced Security Properties
CSF '12 Proceedings of the 2012 IEEE 25th Computer Security Foundations Symposium
| Hi-index | 0.00 |
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 confluent, terminating, and coherent modulo E, and (ii) on reducing unification problems to a set of problems $s =_{}^{?} t$ under the constraint that t remains R/E-irreducible. We call this method asymmetric unification. We first present a general-purpose generic asymmetric unification algorithm. and then outline an approach for converting special-purpose conventional unification algorithms to asymmetric ones, demonstrating it for exclusive-or with uninterpreted function symbols. We demonstrate how asymmetric unification can improve performanceby running the algorithm on a set of benchmark problems. We also give results on the complexity and decidability of asymmetric unification.