Knowledge problems vs unification and matching: dichotomy results
From MaRDI portal
Cites work
- Automated verification of equivalence properties of cryptographic protocols
- Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols
- Computing knowledge in equational extensions of subterm convergent theories
- Computing knowledge in security protocols under convergent equational theories
- Decidability and complexity analysis by basic paramodulation
- Deciding knowledge in security protocols under equational theories
- Foundations of Software Science and Computation Structures
- scientific article; zbMATH DE number 2090320 (Why is no real title available?)
- Intruders with Caps
- Knowledge problems in security protocols: going beyond subterm convergent theories
- Mobile values, new names, and secure communication
- Non-disjoint combined unification and closure by equational paramodulation
- Notions of knowledge in combinations of theories sharing constructors
- On the unification problem for Cartesian closed categories
- Single versus simultaneous equational unification and equational unification for variable-permuting theories
- Static equivalence \textit{is} harder than knowledge
- Unification in combinations of collapse-free regular theories
- Unification in permutative equational theories is undecidable
- Unification modulo homomorphic encryption
- YAPA: a generic tool for computing intruder knowledge
This page was built for publication: Knowledge problems vs unification and matching: dichotomy results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296813)
