The following pages link to YAPA (Q15278):
Displayed 16 items.
- Reducing equational theories for the decision of static equivalence (Q437026) (← links)
- Computing knowledge in security protocols under convergent equational theories (Q437033) (← links)
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- Intruder deduction problem for locally stable theories with normal forms and inverses (Q683746) (← links)
- Compiling and securing cryptographic protocols (Q990127) (← links)
- Stateful applied pi calculus: observational equivalence and labelled bisimilarity (Q2397042) (← links)
- Automated Verification of Equivalence Properties of Cryptographic Protocols (Q2892723) (← links)
- Deciding knowledge in security protocols under some e-voting theories (Q3095038) (← links)
- Model Checking Security Protocols (Q3176380) (← links)
- The Applied Pi Calculus (Q3177888) (← links)
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties (Q3184784) (← links)
- Computing knowledge in equational extensions of subterm convergent theories (Q5139279) (← links)
- Computing Knowledge in Security Protocols under Convergent Equational Theories (Q5191113) (← links)
- Automated Verification of Equivalence Properties of Cryptographic Protocols (Q5278194) (← links)
- (Q5389067) (← links)
- Automating Security Analysis: Symbolic Equivalence of Constraint Systems (Q5747780) (← links)