The following pages link to Maude-NPA (Q24090):
Displaying 31 items.
- Efficient general AGH-unification (Q462489) (← links)
- Intruder deduction problem for locally stable theories with normal forms and inverses (Q683746) (← links)
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude (Q1655486) (← links)
- A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols (Q1744440) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description) (Q2104541) (← links)
- Symbolic computation in Maude: some tapas (Q2119100) (← links)
- Terminating non-disjoint combined unification (Q2119106) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- Programming and symbolic computation in Maude (Q2291818) (← links)
- Combining proverif and automated theorem provers for security protocol verification (Q2305427) (← links)
- A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols (Q2424886) (← links)
- Optimization of rewrite theories by equational partial evaluation (Q2667190) (← links)
- Built-in Variant Generation and Unification, and Their Applications in Maude 2.7 (Q2817918) (← links)
- José Meseguer: Scientist and Friend Extraordinaire (Q2945698) (← links)
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude (Q2945699) (← links)
- Two Decades of Maude (Q2945709) (← links)
- Model Checking Security Protocols (Q3176380) (← links)
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties (Q3184784) (← links)
- Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols (Q3304811) (← links)
- Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories (Q3460872) (← links)
- (Q5020553) (← links)
- (Q5020960) (← links)
- Bounded ACh unification (Q5139278) (← links)
- Computing knowledge in equational extensions of subterm convergent theories (Q5139279) (← links)
- Order-sorted Equational Unification Revisited (Q5166637) (← links)
- Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives (Q5179050) (← links)
- Variant Narrowing and Equational Unification (Q5179131) (← links)
- Efficient General Unification for XOR with Homomorphism (Q5200040) (← links)
- (Q5270090) (← links)
- Automated Verification of Equivalence Properties of Cryptographic Protocols (Q5278194) (← links)
