Asymmetric unification: a new unification paradigm for cryptographic protocol analysis
From MaRDI portal
Publication:4928441
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)- Asymmetric unification and disunification
- On unification modulo one-sided distributivity: algorithms, variants and asymmetry
- An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis
- scientific article; zbMATH DE number 2043528 (Why is no real title available?)
- On asymmetric unification for the theory of XOR with a homomorphism
- Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysis Method
- Emerging issues and trends in formal methods in cryptographic protocol analysis: twelve years later
- Bounded ACh unification
- Local XOR unification: definitions, algorithms and application to cryptography
- Efficient general unification for XOR with homomorphism
- Mechanizing Mathematical Reasoning
- Variant-Based Satisfiability in Initial Algebras
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)