Asymmetric unification: a new unification paradigm for cryptographic protocol analysis
DOI10.1007/978-3-642-38574-2_16zbMATH Open1381.68264OpenAlexW40499433WikidataQ118190377 ScholiaQ118190377MaRDI QIDQ4928441FDOQ4928441
Authors: Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse, Catherine Meadows 
Publication date: 14 June 2013
Published in: Automated Deduction – CADE-24 (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/71830
Recommendations
- On Asymmetric Unification and the Combination Problem in Disjoint Theories
- On asymmetric unification for the theory of XOR with a homomorphism
- On unification modulo one-sided distributivity: algorithms, variants and asymmetry
- Efficient general unification for XOR with homomorphism
- Mechanizing Mathematical Reasoning
Cited In (12)
- On unification modulo one-sided distributivity: algorithms, variants and asymmetry
- Title not available (Why is that?)
- Emerging issues and trends in formal methods in cryptographic protocol analysis: twelve years later
- Mechanizing Mathematical Reasoning
- An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis
- Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysis Method
- On asymmetric unification for the theory of XOR with a homomorphism
- Efficient general unification for XOR with homomorphism
- Asymmetric unification and disunification
- Local XOR unification: definitions, algorithms and application to cryptography
- Variant-Based Satisfiability in Initial Algebras
- Bounded ACh unification
Uses Software
This page was built for publication: Asymmetric unification: a new unification paradigm for cryptographic protocol analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928441)
