Abstracting Cryptographic Protocols with Tree Automata
No abstract available.
DOI 10.1007/3-540-48294-6_10
Related papers
- Abstracting Cryptographic Protocols by Prolog Rules SAS 2001
- Scalable Tree-based Register Automata Learning TACAS 2024
- What Makes a Cryptographic Protocol Secure? The Evolution of Requirements Specification in Formal Cryptographic Protocol Analysis ESOP 2003
- TAPS: A First-Order Verifier for Cryptographic Protocols CAV 2000
- Analyzing Cryptographic Protocols in a Reactive Framework VMCAI 2002
- Invited Address: Applying Formal Methods to Cryptographic Protocol Analysis CAV 2000
- A Bisimulation Method for Cryptographic Protocols ESOP 1998
- Automatic Verification of Time Sensitive Cryptographic Protocols TACAS 2004