On the relationships between models in protocol verification
From MaRDI portal
Publication:2482448
Recommendations
Cites work
- A formal language for cryptographic protocol requirements
- Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
- Analyzing security protocols with secrecy types and logic programs
- Computer Aided Verification
- scientific article; zbMATH DE number 1614701 (Why is no real title available?)
- scientific article; zbMATH DE number 1341618 (Why is no real title available?)
- scientific article; zbMATH DE number 1956548 (Why is no real title available?)
- scientific article; zbMATH DE number 1962758 (Why is no real title available?)
- scientific article; zbMATH DE number 1903362 (Why is no real title available?)
- Injective synchronisation: An extension of the authentication hierarchy
- On the security of public key protocols
- Optimistic fair exchange of digital signatures
- Security protocols: from linear to classical logic by abstract interpretation
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
Cited in
(3)
This page was built for publication: On the relationships between models in protocol verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482448)