The following pages link to TAMARIN (Q35211):
Displayed 22 items.
- Automated type-based analysis of injective agreement in the presence of compromised principals (Q492914) (← links)
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- A procedure for deciding symbolic equivalence between sets of constraint systems (Q2013557) (← links)
- A decidable class of security protocols for both reachability and equivalence properties (Q2031426) (← links)
- Gaining trust by tracing security protocols (Q2095430) (← links)
- Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description) (Q2104541) (← links)
- Symbolic computation in Maude: some tapas (Q2119100) (← links)
- Terminating non-disjoint combined unification (Q2119106) (← links)
- MoSS: modular security specifications framework (Q2128988) (← links)
- Protocol analysis with time and space (Q2154006) (← links)
- Programming and symbolic computation in Maude (Q2291818) (← links)
- Combining proverif and automated theorem provers for security protocol verification (Q2305427) (← links)
- Formal analysis and offline monitoring of electronic exams (Q2402552) (← links)
- Built-in Variant Generation and Unification, and Their Applications in Maude 2.7 (Q2817918) (← links)
- Alice and Bob Meet Equational Theories (Q2945705) (← links)
- Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later (Q2945721) (← links)
- Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols (Q3304811) (← links)
- On Communication Models When Verifying Equivalence Properties (Q3304813) (← links)
- (Q5020553) (← links)
- (Q5270090) (← links)
- Relating Process Languages for Security and Communication Correctness (Extended Abstract) (Q5881535) (← links)
- Designing reliable distributed systems. A formal methods approach based on executable modeling in Maude (Q5971098) (← links)