Constraint Abstraction in Verification of Security Protocols
From MaRDI portal
Recommendations
- Modeling and verifying time sensitive security protocols with constraints
- Constraints Solution for Time Sensitive Security Protocols
- Tools and Algorithms for the Construction and Analysis of Systems
- Is Your Security Protocol on Time ?
- Modelling and checking timed authentication of security protocols
Cites work
- A simple framework for real-time cryptographic protocol analysis with compositional proof rules
- Analyzing security protocols with secrecy types and logic programs
- CONCUR 2004 - Concurrency Theory
- Constraints Solution for Time Sensitive Security Protocols
- scientific article; zbMATH DE number 1948406 (Why is no real title available?)
- scientific article; zbMATH DE number 1956549 (Why is no real title available?)
- On the security of public key protocols
- SPVT: an efficient verification tool for security protocols
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(6)- Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables
- scientific article; zbMATH DE number 1948405 (Why is no real title available?)
- scientific article; zbMATH DE number 1956518 (Why is no real title available?)
- scientific article; zbMATH DE number 2104621 (Why is no real title available?)
- Modeling and verifying time sensitive security protocols with constraints
- Logic Programming
This page was built for publication: Constraint Abstraction in Verification of Security Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507341)