The following pages link to The CL-Atse Protocol Analyser (Q3527301):
Displaying 10 items.
- Intruder deducibility constraints with negation. Decidability and application to secured service compositions (Q507348) (← links)
- Satisfiability of general intruder constraints with and without a set constructor (Q507349) (← links)
- Distributed temporal logic for the analysis of security protocol models (Q549724) (← links)
- Intruder deduction for the equational theory of abelian groups with distributive encryption (Q876047) (← links)
- Cathy Meadows: a central figure in protocol analysis (Q2303355) (← links)
- Model Checking Security Protocols (Q3176380) (← links)
- The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols (Q3184787) (← links)
- Comparing State Spaces in Automatic Security Protocol Analysis (Q3631370) (← links)
- Computing knowledge in equational extensions of subterm convergent theories (Q5139279) (← links)
- Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives (Q5179050) (← links)
