CARIBOO
From MaRDI portal
Cited in
(22)- 2OBJ
- Twenty years of rewriting logic
- K-Maude
- SCC
- MU-TERM
- VMTL
- Tsukuba
- TORPA
- Proving operational termination of membership equational programs
- The size-change principle and dependency pairs for termination of term rewriting
- Outermost ground termination
- SymPLFIED
- Orderings and Constraints: Theory and Practice of Proving Termination
- Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations
- From Outermost to Context-Sensitive Rewriting
- Automated Reasoning
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- Proving weak properties of rewriting
- Term Rewriting and Applications
- Theoretical Aspects of Computing - ICTAC 2004
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- Mechanically proving termination using polynomial interpretations
This page was built for software: CARIBOO
