Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysis Method
From MaRDI portal
Publication:6487294
DOI10.1007/978-3-031-12441-9_3zbMATH Open1517.94128MaRDI QIDQ6487294FDOQ6487294
Raúl López-Rueda, Santiago Escobar
Publication date: 7 December 2022
Recommendations
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- S-narrowing for constructor systems
- Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories
- Security Protocol Analysis in Context: Computing Minimal Executions Using SMT and CPSA
Cites Work
- State space reduction in the Maude-NRL protocol analyzer
- Automated Verification of Equivalence Properties of Cryptographic Protocols
- Title not available (Why is that?)
- Conditional rewriting logic as a unified model of concurrency
- Title not available (Why is that?)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Title not available (Why is that?)
- Term Rewriting and Applications
- Completion of a Set of Rules Modulo a Set of Equations
- Folding variant narrowing and optimal variant termination
- Strict coherence of conditional rewriting modulo axioms
- Generalized rewrite theories, coherence completion, and symbolic methods
- Protocol analysis with time
- Canonical narrowing with irreducibility constraints as a symbolic protocol analysis method
- Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis
Cited In (3)
This page was built for publication: Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysis Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487294)
