Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories
From MaRDI portal
Recommendations
- Symbolic protocol analysis for monoidal equational theories
- Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysis Method
- Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
- An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis
- Canonical narrowing with irreducibility constraints as a symbolic protocol analysis method
- Symbolic execution as DPLL modulo theories
- Symbolic reachability analysis based on SAT-solvers
- Combining theorem proving and model checking through symbolic analysis
- Symbolic Model Checking Commitment Protocols Using Reduction
Cites work
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
- Automated verification of selected equivalences for security protocols
- Combination techniques and decision problems for disunification
- Complete axiomatizations of some quotient term algebras
- Conditional rewriting logic as a unified model of concurrency
- Equational problems and disunification
- Folding variant narrowing and optimal variant termination
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Membership algebra as a logical framework for equational specification
- On the security of public key protocols
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- The finite variant property: How to get rid of some algebraic properties
- Using encryption for authentication in large networks of computers
Cited in
(7)- Extending H₁-clauses with disequalities
- Protocol analysis with time
- Protocol analysis with time and space
- Generalized rewrite theories, coherence completion, and symbolic methods
- Symbolic protocol analysis for monoidal equational theories
- Strand spaces with choice via a process algebra semantics
- Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysis Method
This page was built for publication: Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460872)