Maude-NPA
From MaRDI portal
Software:24090
No author found.
Related Items (31)
Model Checking Security Protocols ⋮ Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories ⋮ Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties ⋮ Sentence-normalized conditional narrowing modulo in rewriting logic and Maude ⋮ Optimization of rewrite theories by equational partial evaluation ⋮ José Meseguer: Scientist and Friend Extraordinaire ⋮ Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude ⋮ Two Decades of Maude ⋮ Twenty years of rewriting logic ⋮ A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Efficient general AGH-unification ⋮ Bounded ACh unification ⋮ Computing knowledge in equational extensions of subterm convergent theories ⋮ Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols ⋮ A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols ⋮ Intruder deduction problem for locally stable theories with normal forms and inverses ⋮ Order-sorted Equational Unification Revisited ⋮ Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives ⋮ Variant Narrowing and Equational Unification ⋮ Efficient General Unification for XOR with Homomorphism ⋮ Generalized rewrite theories, coherence completion, and symbolic methods ⋮ Programming and symbolic computation in Maude ⋮ Automated Verification of Equivalence Properties of Cryptographic Protocols ⋮ Built-in Variant Generation and Unification, and Their Applications in Maude 2.7 ⋮ Combining proverif and automated theorem provers for security protocol verification ⋮ Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description) ⋮ Symbolic computation in Maude: some tapas ⋮ Terminating non-disjoint combined unification
This page was built for software: Maude-NPA
