The following pages link to Term Rewriting and Applications (Q5703857):
Displaying 45 items.
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach (Q540685) (← links)
- Non-disjoint combined unification and closure by equational paramodulation (Q831919) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- A procedure for deciding symbolic equivalence between sets of constraint systems (Q2013557) (← 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)
- A partial evaluation framework for order-sorted equational programs modulo axioms (Q2291823) (← links)
- Ground confluence of order-sorted conditional specifications modulo axioms (Q2291829) (← links)
- Combining proverif and automated theorem provers for security protocol verification (Q2305427) (← links)
- Metalevel algorithms for variant satisfiability (Q2413027) (← links)
- Symbolic protocol analysis for monoidal equational theories (Q2482449) (← links)
- Hierarchical combination of intruder theories (Q2482450) (← 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)
- Metalevel Algorithms for Variant Satisfiability (Q2827841) (← links)
- Alice and Bob Meet Equational Theories (Q2945705) (← links)
- Two Decades of Maude (Q2945709) (← links)
- Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later (Q2945721) (← 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)
- Effectively Checking the Finite Variant Property (Q3522010) (← links)
- Challenges in the Automated Verification of Security Protocols (Q3541719) (← links)
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions (Q3636823) (← links)
- Termination Modulo Combinations of Equational Theories (Q3655204) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- Analysing privacy-type properties in cryptographic protocols (invited talk) (Q4993330) (← links)
- (Q5020553) (← links)
- (Q5020960) (← links)
- Computing knowledge in equational extensions of subterm convergent theories (Q5139279) (← links)
- Variant Narrowing and Equational Unification (Q5179131) (← links)
- Automated Verification of Equivalence Properties of Cryptographic Protocols (Q5278194) (← links)
- An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis (Q6052948) (← links)
- Variants and satisfiability in the infinitary unification wonderland (Q6113018) (← links)
- Variant-based equational anti-unification (Q6160760) (← links)
- Variants in the Infinitary Unification Wonderland (Q6486035) (← links)
- Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysis Method (Q6487294) (← links)
- Checking Sufficient Completeness by Inductive Theorem Proving (Q6487296) (← links)
- DeepSec: deciding equivalence properties for security protocols -- improved theory and practice (Q6566464) (← links)
