Efficient general AGH-unification

DOI10.1016/j.ic.2014.07.008zbMath1360.94321OpenAlexW2004781946WikidataQ118190368 ScholiaQ118190368MaRDI QIDQ462489

Christopher Lynch, Zhi-Qiang Liu

Publication date: 20 October 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2014.07.008

zbMATH Keywords

homomorphismabelian groupgeneral unification

Mathematics Subject Classification ID

Cryptography (94A60) Grammars and rewriting systems (68Q42) Network protocols (68M12)

Related Items

Bounded ACh unification

Uses Software

• Maude
• Maude-NPA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unification in commutative theories
• Unification in Boolean rings and Abelian groups
• Unification in a combination of arbitrary disjoint equational theories
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
• A criterion for intractability of E-unification with free function symbols and its relevance for combination of unification algorithms
• Unification algorithms cannot be combined in polynomial time
• Unification and matching modulo nilpotence
• Efficient General Unification for XOR with Homomorphism