Cited in
(24)- Proving termination properties with \textsc{mu-term}
- Generalized and formalized uncurrying
- A Transformational Approach to Prove Outermost Termination Automatically
- Lazy productivity via termination
- Loops under Strategies
- scientific article; zbMATH DE number 7379291 (Why is no real title available?)
- 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
- AProVE
- Tyrolean
- MU-TERM
- Matchbox
- VMTL
- TPDB
- TPA
- TORPA
- Coccinelle
- Max/Plus tree automata for termination of term rewriting
- Increasing interpretations
- Context-sensitive dependency pairs
- Termination of String Rewriting with Matrix Interpretations
- Termination of just/fair computations in term rewriting
This page was built for software: Jambox
