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
- Rule-based programming and proving: The ELAN experience outcomes
- Proving weak properties of rewriting
- A sufficient completeness reasoning tool for partial specifications
- A proof of weak termination providing the right way to terminate
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- Mechanically proving termination using polynomial interpretations
This page was built for software: CARIBOO