SPVT: an efficient verification tool for security protocols
From MaRDI portal
Recommendations
- Automatic verification of security protocols in the symbolic model: the verifier ProVerif
- Security protocol verification: symbolic and computational models
- SPVT-II: An Efficient Security Protocol Verifier Based on Logic Programming
- scientific article; zbMATH DE number 2087629
- Verifying security protocols with PVS: widening the rank function approach
Cited in
(16)- SPVT-II
- SeVe: automatic tool for verification of security protocols
- An automatically verified prototype of the Tokeneer ID station specification
- Security analysis of \textit{SPAKE2+}
- Verifying security protocols with PVS: widening the rank function approach
- Towards an independent semantics and verification technology for the HLPSL specification language
- Constraint Abstraction in Verification of Security Protocols
- SPVT-II: An Efficient Security Protocol Verifier Based on Logic Programming
- scientific article; zbMATH DE number 1069489 (Why is no real title available?)
- scientific article; zbMATH DE number 1796137 (Why is no real title available?)
- scientific article; zbMATH DE number 2087629 (Why is no real title available?)
- Automatic verification of security protocols in the symbolic model: the verifier ProVerif
- A novel derivation framework for definite logic program
- Modeling and verifying time sensitive security protocols with constraints
- Computer Aided Verification
- Recovering the tight security proof of SPHINCS\textsuperscript{+}
This page was built for publication: SPVT: an efficient verification tool for security protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5491199)
