Jambox

swMATH10066MaRDI QIDQ22035FDOQ22035

Author name not available (Why is that?)

Cited In (15)

• A Transformational Approach to Prove Outermost Termination Automatically
• Loops under Strategies
• Lazy productivity via termination
• Title not available (Why is that?)
• Search Techniques for Rational Polynomial Orders
• Certifying a Termination Criterion Based on Graphs, without Graphs
• Modular and certified semantic labeling and unlabeling
• Proving termination in the context-sensitive dependency pair framework
• Max/Plus tree automata for termination of term rewriting
• Increasing interpretations
• Termination of String Rewriting with Matrix Interpretations
• Context-sensitive dependency pairs
• Termination of just/fair computations in term rewriting
• Proving termination properties with \textsc{mu-term}
• Generalized and formalized uncurrying

This page was built for software: Jambox