Protocol Verification Via Rigid/Flexible Resolution
From MaRDI portal
Recommendations
- Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables
- Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses
- Flat and one-variable clauses: complexity of verifying cryptographic protocols with single blind copying
- scientific article; zbMATH DE number 1759624
- scientific article; zbMATH DE number 1832234
Cites work
- A practical secret voting scheme for large scale elections
- Encoding First Order Proofs in SAT
- scientific article; zbMATH DE number 1414298 (Why is no real title available?)
- On the security of public key protocols
- Theorem Proving via General Matings
- Tree Automata with Equality Constraints Modulo Equational Theories
- Using encryption for authentication in large networks of computers
Cited in
(11)- Encoding first order proofs in SMT
- Challenges in the Automated Verification of Security Protocols
- Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses
- Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables
- scientific article; zbMATH DE number 4082597 (Why is no real title available?)
- scientific article; zbMATH DE number 1956518 (Why is no real title available?)
- scientific article; zbMATH DE number 1863380 (Why is no real title available?)
- Flat and one-variable clauses: complexity of verifying cryptographic protocols with single blind copying
- Rigid tree automata and applications
- Logic for Programming, Artificial Intelligence, and Reasoning
- Protocol conformance through refinement mappings in cadence SMV
This page was built for publication: Protocol Verification Via Rigid/Flexible Resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498469)
