Pages that link to "Item:Q3541712"

The following pages link to MTT: The Maude Termination Tool (System Description) (Q3541712):

Displaying 21 items.

• Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
• Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
• A compact fixpoint semantics for term rewriting systems (Q987981) (← links)
• Sentence-normalized conditional narrowing modulo in rewriting logic and Maude (Q1655486) (← links)
• Twenty years of rewriting logic (Q1931904) (← links)
• On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (Q1931906) (← links)
• Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
• Symbolic computation in Maude: some tapas (Q2119100) (← links)
• The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques (Q2228436) (← links)
• Ground confluence of order-sorted conditional specifications modulo axioms (Q2291829) (← links)
• Optimization of rewrite theories by equational partial evaluation (Q2667190) (← links)
• Methods for proving termination of rewriting-based programming languages by transformation (Q2808239) (← links)
• Two Decades of Maude (Q2945709) (← links)
• Integrating Maude into Hets (Q3067467) (← links)
• Proving Termination Properties with mu-term (Q3067476) (← links)
• Termination Modulo Combinations of Equational Theories (Q3655204) (← links)
• Operational Termination of Membership Equational Programs: the Order-Sorted Way (Q5179140) (← links)
• Localized Operational Termination in General Logics (Q5256340) (← links)
• Behavioral Rewrite Systems and Behavioral Productivity (Q5403074) (← links)
• Symbolic Specialization of Rewriting Logic Theories with <tt>Presto</tt> (Q6063888) (← links)
• Maude2Lean: theorem proving for Maude specifications using Lean (Q6643468) (← links)