Cited in
(29)- Intruder deduction problem for locally stable theories with normal forms and inverses
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Computing Knowledge in Security Protocols under Convergent Equational Theories
- Computing knowledge in security protocols under convergent equational theories
- Reducing equational theories for the decision of static equivalence
- The Applied Pi Calculus
- Compiling and securing cryptographic protocols
- AVISPA
- FAST
- Casper
- ProVerif
- OFMC
- SATMC
- scyther
- LALBLC
- Maude-NPA
- NRL
- Akiss
- Apte
- CoSP
- Automating security analysis: symbolic equivalence of constraint systems
- Automated verification of equivalence properties of cryptographic protocols
- Stateful applied pi calculus: observational equivalence and labelled bisimilarity
- Model Checking Security Protocols
- Computing knowledge in equational extensions of subterm convergent theories
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- Deciding knowledge in security protocols under some e-voting theories
- FAST: an efficient decision procedure for deduction and static equivalence
- Automated verification of equivalence properties of cryptographic protocols
This page was built for software: YAPA
