Pages that link to "Item:Q1931909"

The following pages link to Folding variant narrowing and optimal variant termination (Q1931909):

Displaying 35 items.

• Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
• Non-disjoint combined unification and closure by equational paramodulation (Q831919) (← links)
• Sentence-normalized conditional narrowing modulo in rewriting logic and Maude (Q1655486) (← links)
• Equational theorem proving modulo (Q2055853) (← links)
• Capturing constrained constructor patterns in matching logic (Q2096417) (← 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)
• Order-sorted equational generalization algorithm revisited (Q2134938) (← 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)
• Metalevel algorithms for variant satisfiability (Q2413027) (← 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)
• José Meseguer: Scientist and Friend Extraordinaire (Q2945698) (← links)
• Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude (Q2945699) (← 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)
• Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols (Q3304811) (← links)
• Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories (Q3460872) (← links)
• Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
• Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms* (Q4988927) (← links)
• (Q5020553) (← links)
• (Q5020960) (← links)
• Symbolic Analysis of Maude Theories with Narval (Q5108507) (← links)
• Computing knowledge in equational extensions of subterm convergent theories (Q5139279) (← links)
• Automated Verification of Equivalence Properties of Cryptographic Protocols (Q5278194) (← links)
• Functional Logic Programming in Maude (Q5403075) (← links)
• An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis (Q6052948) (← links)
• Symbolic Specialization of Rewriting Logic Theories with <tt>Presto</tt> (Q6063888) (← links)
• Variants and satisfiability in the infinitary unification wonderland (Q6113018) (← links)