Pages that link to "Item:Q860906"
From MaRDI portal
The following pages link to A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties (Q860906):
Displaying 25 items.
- State space reduction in the Maude-NRL protocol analyzer (Q462493) (← links)
- A metamodel of access control for distributed environments: applications and properties (Q462495) (← links)
- Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types (Q880987) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- A decidable class of security protocols for both reachability and equivalence properties (Q2031426) (← links)
- Protocol analysis with time and space (Q2154006) (← links)
- Efficiently deciding equivalence for standard primitives and phases (Q2167745) (← links)
- Narrowing and rewriting logic: from foundations to applications (Q2873786) (← links)
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties (Q3184784) (← links)
- A Finite Representation of the Narrowing Space (Q3453648) (← links)
- Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories (Q3460872) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- Effectively Checking the Finite Variant Property (Q3522010) (← links)
- A Modular Equational Generalization Algorithm (Q3617428) (← links)
- Variant Narrowing and Equational Unification (Q5179131) (← links)
- Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif (Q5253587) (← links)
- Termination of Narrowing in Left-Linear Constructor Systems (Q5458432) (← links)
- Termination of Narrowing Using Dependency Pairs (Q5504664) (← links)
- An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis (Q6052948) (← links)
- Rewriting Privacy (Q6487293) (← links)
- Formalization and analysis of the post-quantum signature scheme FALCON with Maude (Q6671789) (← links)
