Graph-embedded rewrite systems: combination and undecidability results
From MaRDI portal
Cites work
- Automated verification of equivalence properties of cryptographic protocols
- Completion of a Set of Rules Modulo a Set of Equations
- Computer Aided Verification
- Computing knowledge in equational extensions of subterm convergent theories
- Computing knowledge in security protocols under convergent equational theories
- Decidability and combination results for two notions of knowledge in security protocols
- Deciding knowledge in security protocols under equational theories
- FAST: an efficient decision procedure for deduction and static equivalence
- scientific article; zbMATH DE number 2090320 (Why is no real title available?)
- Intruder deduction problem for locally stable theories with normal forms and inverses
- Knowledge problems in security protocols: going beyond subterm convergent theories
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Mobile values, new names, and secure communication
- Notions of knowledge in combinations of theories sharing constructors
- Single versus simultaneous equational unification and equational unification for variable-permuting theories
- Term Rewriting and All That
- The CL-Atse Protocol Analyser
- The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
- Unification theory
- YAPA: a generic tool for computing intruder knowledge
This page was built for publication: Graph-embedded rewrite systems: combination and undecidability results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852312)
