Cited in
(41)- Matrix Interpretations for Proving Termination of Term Rewriting
- Match-bounds revisited
- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
- Loops under Strategies
- Certification of Termination Proofs Using CeTA
- Automatic synthesis of logical models for order-sorted first-order theories
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
- Termination proofs for string rewriting systems via inverse match-bounds
- Frontiers of Combining Systems
- Proving termination of context-sensitive rewriting by transformation
- Transforming SAT into termination of rewriting
- Term Rewriting and Applications
- CeTA
- AProVE
- Tyrolean
- CoLoR
- CiME
- Jambox
- MU-TERM
- TPDB
- TPA
- TORPA
- Tsukuba
- HSL_MC64
- ConCon
- Nagoya Termination Tool
- Matchbox
- term-rewriting
- Weighted automata for proving termination of string rewriting
- WANDA
- Increasing interpretations
- Implementation and Application of Automata
- Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems
- Tyrolean termination tool: techniques and features
- On tree automata that certify termination of left-linear term rewriting systems
- Lower bounds for runtime complexity of term rewriting
- NaTT
- Termination of String Rewriting with Matrix Interpretations
- Termination of just/fair computations in term rewriting
- Loop detection in term rewriting using the eliminating unfoldings
- Termination of string rewriting proved automatically
This page was built for software: Matchbox
