Verifying security protocols modelled by networks of automata
From MaRDI portal
Recommendations
- SAT-Based Verification of Security Protocols Via Translation to Networks of Automata
- Timed automata based model checking of timed security protocols
- scientific article; zbMATH DE number 1903362
- scientific article; zbMATH DE number 6300104
- Automatic verification of security protocols in the symbolic model: the verifier ProVerif
Cited in
(18)- SeVe: automatic tool for verification of security protocols
- Using probabilistic automata for security protocols verification
- Verifying security protocols with PVS: widening the rank function approach
- Let’s Get Physical: Models and Methods for Real-World Security Protocols
- Automated Verification of Dynamic Root of Trust Protocols
- Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets
- A team automaton scenario for the analysis of security properties of communication protocols
- Analyzing Security Protocols in Hierarchical Networks
- Proving Group Protocols Secure Against Eavesdroppers
- Challenges in the Automated Verification of Security Protocols
- scientific article; zbMATH DE number 1903362 (Why is no real title available?)
- Timed automata based model checking of timed security protocols
- Foundations of Software Science and Computation Structures
- Trustworthy Global Computing
- scientific article; zbMATH DE number 6300104 (Why is no real title available?)
- Verification of the TESLA protocol in MCMAS-X
- SAT-Based Verification of Security Protocols Via Translation to Networks of Automata
- LDYIS: a framework for model checking security protocols
This page was built for publication: Verifying security protocols modelled by networks of automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5422290)
