YAPA: a generic tool for computing intruder knowledge
From MaRDI portal
Recommendations
- YAPA: A Generic Tool for Computing Intruder Knowledge
- Computing knowledge in security protocols under convergent equational theories
- Computing Knowledge in Security Protocols under Convergent Equational Theories
- Automata, Languages and Programming
- Computing knowledge in equational extensions of subterm convergent theories
Cited in
(10)- Intruder deduction problem for locally stable theories with normal forms and inverses
- DeepSec: deciding equivalence properties for security protocols -- improved theory and practice
- YAPA: A Generic Tool for Computing Intruder Knowledge
- YAPA
- Graph-embedded rewrite systems: combination and undecidability results
- Knowledge problems in protocol analysis: extending the notion of subterm convergent
- Stateful applied pi calculus: observational equivalence and labelled bisimilarity
- Computing knowledge in equational extensions of subterm convergent theories
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- FAST: an efficient decision procedure for deduction and static equivalence
This page was built for publication: YAPA: a generic tool for computing intruder knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946688)